Java-集合( LinkedList底层分析)

LinkedList底层分析

源码场景

LinkedList<String> list = new LinkedList<>();list.add("小宇");
list.add("小蒲");
list.add("小康");

源码分析

public abstract class AbstractList<E> extends AbstractCollection<E> implements List<E> {//外部操作数protected transient int modCount = 0;
}

public abstract class AbstractSequentialList<E> extends AbstractList<E> {
}

public class LinkedList<E> extends AbstractSequentialList<E> implements List<E>{//元素个数transient int size = 0;//0//第一个节点transient Node<E> first;//null//最后一个节点transient Node<E> last;//nullpublic LinkedList() {}public boolean add(E e) {linkLast(e);return true;}void linkLast(E e) {final Node<E> l = last;final Node<E> newNode = new Node<>(l, e, null);last = newNode;if (l == null)first = newNode;elsel.next = newNode;size++;modCount++;}//节点类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;}}
}