jdk1.8 LinkedList增删改的过程

先给出链表结构:

1.LinkedList由N个Node构成,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;
        }
    }

item代表所存放的数据,next代表链表连接的下一个Node,prev反之.

2.LinkedList的属性:

transient int size = 0;

transient Node<E> first;

transient Node<E> last;

分别代表:大小,头结点,尾节点.

3.LinkedList有2个Constructors,分别是:

public LinkedList() {
}
public LinkedList(Collection<? extends E> c) {
    this();
    addAll(c);
}

含参的Constructor的参数可以放LinkedList也可以放ArrayList,只要它实现了Collection接口.

4.当使用linkedListInstance.add(Object value)方法为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;
    else
        l.next = newNode;
    size++;
    modCount++;
}

过程是这样的:

5.说完了添加的过程,现在到修改的过程linkedListInstance.set(int index,Object value),代码:

public E set(int index, E element) {
    checkElementIndex(index);
    Node<E> x = node(index);
    E oldVal = x.item;
    x.item = element;
    return oldVal;
}
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;
    }
}
private void checkElementIndex(int index) {
    if (!isElementIndex(index))
        throw new IndexOutOfBoundsException(outOfBoundsMsg(index));
}
private boolean isElementIndex(int index) {
    return index >= 0 && index < size;
}

修改的过程还是比较简单,这里简单说明一下就好了.

5.1.首先checkElementIndex用于检查输入的index是否满足0<=index<size,不满足会抛出异常.

5.2.然后通过node方法找到对应下标的node

5.3.更新node的item的值.

5.4.返回原来item的值.

6.删除的过程,代码如下(部分方法上面已给出):

public E remove(int index) {
    checkElementIndex(index);
    return unlink(node(index));
}
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;
}

过程如图: