java手写双向链表

下面是一个简单的Java代码示例，用于手写一个双向链表：
public class DoublyLinkedList<T> {
private Node<T> head;
private Node<T> tail;

private static class Node<T> {
T data;
Node<T> prev;
Node<T> next;

public Node(T data) {
this.data = data;
}
}

public void addToFront(T data) {
Node<T> newNode = new Node<>(data);

if (head == null) {
head = newNode;
tail = newNode;
} else {
newNode.next = head;
head.prev = newNode;
head = newNode;
}
}

public void addToEnd(T data) {
Node<T> newNode = new Node<>(data);

if (tail == null) {
head = newNode;
tail = newNode;
} else {
newNode.prev = tail;
tail.next = newNode;
tail = newNode;
}
}

public void remove(T data) {
Node<T> current = head;

while (current != null) {
if (current.data.equals(data)) {
if (current == head &amp;&amp; current == tail) {
head = null;
tail = null;
} else if (current == head) {
head = head.next;
head.prev = null;
} else if (current == tail) {
tail = tail.prev;
tail.next = null;
} else {
current.prev.next = current.next;
current.next.prev = current.prev;
}
break;
}
current = current.next;
}
}

public void printList() {
Node<T> current = head;

while (current != null) {
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
}
登录后复制
这个示例实现了双向链表的基本操作，包括在链表头部和尾部插入节点，以及删除指定节点。你可以根据需要进行扩展和修改。