双向链表和单向链表.docVIP

双向链表和单向链表 双向循环链表和单链表(java) 下载源代码 〖 作者：不详 〗〖 大小：2k 〗〖 发布日期：2012-07-28 〗〖 浏览：0 〗 java实现双向循环链表和单链表. 1.双向循环链表 public class LinkedList { private int size = 0; private Node head = new Node(null, null, null); public LinkedList() { head.next = head.previous = head; } public void add(E date) { //核心 循环双向链表 //新节点的prev指向头结点的prev 新节点的next指向头结点 Node E newNode = new Node E(head.previous, date, head); newNode.previous.next = newNode; //调整，新节点的前一个的后一个 newNode.next.previous = newNode; //调整，新节点的后一个的前一个 size++; } public E get(int index) { if (index 0 || index = size) { throw new IndexOutOfBoundsException(Index: + index + ,size: + size); } Node E node = head; if (index (size 1)) { for (int i = 0; i= index; i++){//head是哑元，i=index当index=0时，返回head.next node = node.next; //对头结点进行迭代 } }else{ for(int i=size;iindex;i--){ node=node.previous; } } return node.getData(); } public int size() { return size; } public static void main(String[] args) { LinkedList Integer list = new LinkedList Integer(); list.add(1); list.add(2); list.add(3); list.add(4); list.add(5); list.add(6); list.add(7); list.add(8); System.out.println(list.get(3)=+list.get(3)); for (int i = 0; i list.size(); i++) { System.out.println(list.get(i)); } } class Node E { E data; Node E next; Node E previous; public Node(Node E previous, E data, Node E next) { this.data = data; this.next = next; this.previous = previous; } public E getData(){ return data; } public void setData(E data){ this.data=data; } } } 2、单链表： public class SingleLinkedList T { private int