LinkedList源碼（基礎(chǔ)代碼）

mikasa 發(fā)布于2019-08-16 14:03 / 2183人閱讀

摘要：是由一個一個節(jié)點連接起來的鏈表增刪改查其他檢索出第一個元素，但不取出檢索出第一個元素，同時取出

LinkedList是由一個一個節(jié)點連接起來的鏈表

private static class Node {
        E item;
        Node next;
        Node prev;

        Node(Node prev, E element, Node next) {
            this.item = element;
            this.next = next;
            this.prev = prev;
        }
    }

增

    public boolean add(E e) {
        linkLast(e);
        return true;
    }

    public void addFirst(E e) {
        linkFirst(e);
    }
    private void linkFirst(E e) {
        final Node f = first;
        final Node newNode = new Node<>(null, e, f);
        first = newNode;
        if (f == null)
            last = newNode;
        else
            f.prev = newNode;
        size++;
        modCount++;
    }
    public void addLast(E e) {
        linkLast(e);
    }
    void linkLast(E e) {
        final Node l = last;
        final Node newNode = new Node<>(l, e, null);
        last = newNode;
        if (l == null)
            first = newNode;
        else
            l.next = newNode;
        size++;
        modCount++;
    }

刪

    public boolean remove(Object o) {
        if (o == null) {
            for (Node x = first; x != null; x = x.next) {
                if (x.item == null) {
                    unlink(x);
                    return true;
                }
            }
        } else {
            for (Node x = first; x != null; x = x.next) {
                if (o.equals(x.item)) {
                    unlink(x);
                    return true;
                }
            }
        }
        return false;
    }
    
    public E remove(int index) {
        checkElementIndex(index);
        return unlink(node(index));
    }

改

    public E set(int index, E element) {
        checkElementIndex(index);
        Node x = node(index);
        E oldVal = x.item;
        x.item = element;
        return oldVal;
    }

查

    public E get(int index) {
        checkElementIndex(index);
        return node(index).item;
    }

其他

    // 檢索出第一個元素，但不取出
    public E peek() {
        final Node f = first;
        return (f == null) ? null : f.item;
    }
    // 檢索出第一個元素，同時取出
    public E poll() {
        final Node f = first;
        return (f == null) ? null : unlinkFirst(f);
    }