[英]Convert a singly linked list to a doubly linked list
这是我目前拥有的代码。 仅包含addFirst方法。
public void addFirst(E e) {
Node<E> newNode = new Node<E>(e);
if (tail == null)
head = tail = newNode;
else {
newNode.next = head;
head = newNode;
}
size++;
}
private static class Node<E> {
E element;
Node<E> next;
public Node(E e) {
element = e;
}
}
尝试设置“上一个”字段
public void addFirst(E e) {
Node<E> newNode = new Node<E>(e);
if (tail == null)
head = tail = newNode;
else {
newNode.next = head;
firstElement.previous = newNode; //*
head = newNode;
newNode.previous = null;
}
size++;
}
private static class Node<E> {
E element;
Node<E> next, previous; //adding previous field
public Node(E e) {
element = e;
}
}
*我希望firstElement.previous指向newNode。 我怎么做?
更改:
firstElement.previous = newNode
至
head.previous = newNode;
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.