java核心基础--jdk源码分析学习--LinkedList

java.util.LinkedList

1. 内部由内部类Node存储单节点数据，双向循环链表

private static class Node<E> {
E item;
Node<E> next;
Node<E> prev;

Node(Node<E> prev, E element, Node<E> next) {
this.item = element;
this.next = next;
this.prev = prev;
}
}

2. 注意看node(int index)

Node<E> node(int index) {

if (index < (size >> 1)) {
Node<E> x = first;
for (int i = 0; i < index; i++)
x = x.next;
return x;
} else {
Node<E> x = last;
for (int i = size - 1; i > index; i--)
x = x.prev;
return x;
}
}

3. 增删改查效率，参考对链表的操作