例如,如果我有 LinkedList
LinkedList<Integer> ll = new LinkedList<Integer>();
ll.add(1);
ll.add(2);
ll.add(3);
Integer x = new Integer(10);
ll.add(x);
ll.add(4);
// now the list looks like 1->2->3->10->4
// what if I want to remove 10 and I still have the reference to that node x
// what is the API of that
// somethings like ll.remove(x)...
如果我自己实现一个双向链表,只需
currentNode.prev.next = currentNode.next;
currentNode.next.prev = currentNode.prev;
Java 的 LinkedList 实现是否支持这种操作?