LinkedList和ArrayList都实现了List,但是两者的存储结构不一样:LinkedList是链表,ArrayList是数组,那就决定了两者特性不一样:
LinkedList插入删除方便效率高,但是根据索引查找就需要遍历,比较慢了,而ArrayList恰恰相反
主要有如下方法:
E unlink(Node<E> x) {
// assert x != null;
final E element = x.item;
final Node<E> next = x.next;
final Node<E> prev = x.prev;
if (prev == null) {
first = next;
} else {
prev.next = next;
x.prev = null;
}
if (next == null) {
last = prev;
} else {
next.prev = prev;
x.next = null;
}
x.item = null;
size--;
modCount++;
return element;
}
删除某个节点数据:把该节点的前后数据的关系重新建立即可
/**
* Inserts element e before non-null Node succ.
*/
void linkBefore(E e, Node<E> succ) {
// assert succ != null;
final Node<E> pred = succ.prev;
final Node<E> newNode = new Node<>(pred, e, succ);
succ.prev = newNode;
if (pred == null)
first = newNode;
else
pred.next = newNode;
size++;
modCount++;
}
在succ节点之前插入数据
Node<E> node(int index) {
// assert isElementIndex(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;
}
}
根据索引查找Node节点,此处有个小巧的设计:如果查找的索引小于size的一般则从前往后找,否则从后往前找;从代码中可以看出,根据索引查找节点需要遍历
由于LinkedList也实现了Deque接口,所以LinkedList也是一种队列实现
public E peek() {
final Node<E> f = first;
return (f == null) ? null : f.item;
}
获取队列头数据
public E poll() {
final Node<E> f = first;
return (f == null) ? null : unlinkFirst(f);
}
获取队列头数据并同时移除头部数据