在进行源码分析时,我们需要知道LinkedList底层是什么
LinkedList底层是双向链表
transient int size = 0;
transient Node<E> first; //指向第一个节点
transient Node<E> last; //指向最后一个节点
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、remove方法
public E remove(int index) {
checkElementIndex(index); //检查索引是否越界
return unlink(node(index));
}
Node<E> node(int index) {
//看你的索引在左半边还是右半边,左半边就从first开始遍历找
if (index < (size >> 1)) { //a >> 1:代表a/2
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;
}
}
双向链表删除操作,直接定位到待删除结点就可以
E unlink(Node<E> x) {
final E element = x.item;
final Node<E> next = x.next;
final Node<E> prev = x.prev;
if (prev == null) { //待删除结点的prev是空的,说明待删除节点是first
first = next; //重新定位first
} else {
prev.next = next; //前指后
x.prev = null; //脱链
}
if (next == null) { //待删除结点的next是空的,说明待删除节点是last
last = prev; //重新定位last
} else {
next.prev = prev; //后指前
x.next = null; //脱链
}
x.item = null; //存储元素置null,此时无引用指向且自身全部为null,gc回收
size--;
modCount++;
return element;
}