LinkList

linklist 可以作为双向链表，作为栈（push、pop），作为双向队列（offerFirst、offerLast、pollFirst、pollLast）

 //链表长度
 transient int size = 0;
 //链表头指针
 transient Node<E> first;
 //链表尾指针
 transient Node<E> last;
//构造函数，将传入的集合转为链表
 public LinkedList(Collection<? extends E> c) {
        this();
        addAll(c);
    }
    //从index个节点开始插入集合c
 public boolean addAll(int index, Collection<? extends E> c) {
 		//检查传入的索引是否有效
        checkPositionIndex(index);
        //检查传入的数据是否有效
        Object[] a = c.toArray();
        int numNew = a.length;
        if (numNew == 0)
            return false;
        Node<E> pred, succ;
        //如果传入的索引是链表尾结点的索引
        if (index == size) {
            succ = null;
            pred = last;
        }
        //succ=第index个节点 
        else {
            succ = node(index);
            pred = succ.prev;
        }
		//将数据转为节点并进行连接
        for (Object o : a) {
        	//强转为E类型
            E e = (E) o;
            Node<E> newNode = new Node<>(pred, e, null);
            if (pred == null)
                first = newNode;
            else
                pred.next = newNode;
            pred = newNode;
        }
        if (succ == null) {
            last = pred;
        } else {
            pred.next = succ;
            succ.prev = pred;
        }

        size += numNew;
        modCount++;
        return true;
    }
    //将f.next作为链表头结点并返回f包含的元素
     private E unlinkFirst(Node<E> f) {
        // assert f == first && f != null;
        final E element = f.item;
        final Node<E> next = f.next;
        f.item = null;
        f.next = null; // help GC
        first = next;
        if (next == null)
            last = null;
        else
            next.prev = null;
        size--;
        modCount++;
        return element;
    }
    //删除链表中的x节点，并返回x节点代表的元素
     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;
    }