java实现双向链表

public class DoubleLinkedList {
    //创建链表的节点类
private static class Node {
Object value;
Node prev = this;
Node next = this;

Node(Object v) {
this.value = v;
}

public String toString() {
return value.toString();
}
}


private Node head = new Node(null);
private int size = 0;

public String toString() {
StringBuffer sb = new StringBuffer("[");
Node node = head;
for (int i = 0; i < size; i++) {
node = node.next;
if (i > 0) {
sb.append(", ");
}
sb.append(node.value);
}
sb.append("]");
return sb.toString();
}

public boolean addFirst(Object o) {
addAfter(new Node(o), head);
return true;
}

public boolean addLast(Object o) {
addBefore(new Node(o), head);
return true;
}

public boolean add(Object o) {
return addLast(o);
}

public boolean add(int index, Object o) {
addBefore(new Node(o), getNode(index));
return true;
}

public boolean remove(int index) {
removeNode(getNode(index));
return true;
}

public boolean removeFirst() {
removeNode(head.next);
return true;
}

public boolean removeLast() {
removeNode(head.prev);
return true;
}

public Object get(int index) {
return getNode(index).value;
}

public void addBefore(Node newNode, Node node) {


/*
* newNode.next = node; newNode.prev = node.prev; newNode.next.prev =
* newNode; newNode.prev.next = newNode;
*/
if (node == null) {
node = newNode;
} else {
newNode.prev = node.prev;
node.prev.next = newNode;
node.prev = newNode;
newNode.next = node;
}


size++;
}


public void addAfter(Node newNode, Node node) {
/*
* newNode.prev = node; newNode.next = node.next; newNode.next.prev =
* newNode; newNode.prev.next = newNode;
*/
if (node == null) {
node = newNode;
} else {
newNode.next = node.next;
node.next.prev = newNode;
node.next = newNode;
newNode.prev = node;
}


size++;
}


public void removeNode(Node node) {
node.prev.next = node.next;
node.next.prev = node.prev;
node.prev = null;
node.next = null;
size--;
}


public Node getNode(int index) {
if (index < 0 || index >= size) {
throw new IndexOutOfBoundsException();
}


Node node = head.next;
for (int i = 0; i < index; i++) {
node = node.next;
}
return node;


}


public int size() {
return size;
}


}