04-双向链表

双向链表

        /**
     * 获取index位置对应的节点对象
     * size >> 1  等于size/2
     * size << 2  等于size*2
     */
    private Node<E> node(int index) {
        rangeCheck(index);
        
        if (index < (size >> 1)) {
            Node<E> node = first;
            for (int i = 0; i < index; i++) {
                node = node.next;
            }
        }else {
            Node<E> node = last;
            for (int i = size - 1; i > index; i--) {
                node = node.prev;
            }
        }
        
        return node;
    }

//清除对象
public void clear() {
// TODO Auto-generated method stub
size = 0;
first = null;
last = null;
}
注:在java中，栈指针指向的对象称为gc root对象，一个对象不被gc root对象引用就会被释放。

add add add在首节点 add在最后节点 考虑链表刚开始没有节点时add操作

public void add(int index, E element) {
        // TODO Auto-generated method stub
        rangeCheekForAdd(index);
        if (index == size) {
            Node<E> oldLast = last;
            last = new Node<>(oldLast, element, null);
            if (oldLast == null) {
                first = last;
            }else {
                oldLast.next = last;
            }
            
        }else {
            Node<E> next = node(index);
            Node<E> prev = next.prev;
            Node<E> node = new Node<>(prev, element, next);
            next.prev = node;
            if (prev == null) { //index == 0
                first = node;
            }else {
                prev.next = node;
            }
        }
        size ++;
    }

---

remove操作

public E remove(int index) {
        // TODO Auto-generated method stub
        Node<E> node = node(index);
        Node<E> prev = node.prev;
        Node<E> next = node.next;
        if (prev == null) { // index == 0,删除第一个
            first = next;
            next.prev = null;
        }else {
            prev.next = next;
        }
        
        if (next == null) { //index == size - 1,删除最后一个
            last = prev;
            prev.next = null;
        }else {
            next.prev = prev;
        }
        size --;
        return node.element;
    }

测试：

测试

package com.weyan;

public class LinkedList<E> implements List<E> {
    private static final int ELEMENT_NOT_FOUND = -1;
    private int size;
    private Node<E> first;
    private Node<E> last;
    
    //内部类
    private static class Node<E> {
        E element;
        Node<E> prev;
        Node<E> next;
        //构造函数
        public Node(Node<E> prev,E element, Node<E> next) {
            super();
            this.element = element;
            this.next = next;
            this.prev = prev;
        }
        
    }

    @Override
    public void clear() {
        // TODO Auto-generated method stub
        size = 0;
        first = null;
        last = null;
    }

    @Override
    public int size() {
        // TODO Auto-generated method stub
        return size;
    }

    @Override
    public boolean isEmpty() {
        // TODO Auto-generated method stub
        return size == 0;
    }

    @Override
    public boolean contains(E element) {
        // TODO Auto-generated method stub
        return indexOf(element) != ELEMENT_NOT_FOUND;
    }

    @Override
    public void add(E element) {
        // TODO Auto-generated method stub
        add(size, element);
    }

    @Override
    public E get(int index) {
        // TODO Auto-generated method stub
        return node(index).element;
    }

    @Override
    public E set(int index, E element) {
        // TODO Auto-generated method stub
        
        Node<E> node = node(index);
        E old = node.element;
        node.element = element;
        return old;
    }

    @Override
    public void add(int index, E element) {
        // TODO Auto-generated method stub
        rangeCheekForAdd(index);
        if (index == size) {
            Node<E> oldLast = last;
            last = new Node<>(oldLast, element, null);
            if (oldLast == null) {
                first = last;
            }else {
                oldLast.next = last;
            }
            
        }else {
            Node<E> next = node(index);
            Node<E> prev = next.prev;
            Node<E> node = new Node<>(prev, element, next);
            next.prev = node;
            if (prev == null) { //index == 0
                first = node;
            }else {
                prev.next = node;
            }
        }
        size ++;
    }

    @Override
    public E remove(int index) {
        // TODO Auto-generated method stub
        Node<E> node = node(index);
        Node<E> prev = node.prev;
        Node<E> next = node.next;
        if (prev == null) { // index == 0,删除第一个
            first = next;
            next.prev = null;
        }else {
            prev.next = next;
        }
        
        if (next == null) { //index == size - 1,删除最后一个
            last = prev;
            prev.next = null;
        }else {
            next.prev = prev;
        }
        size --;
        return node.element;
    }

    @Override
    public int indexOf(E element) {
        // TODO Auto-generated method stub
        Node<E> node = first;
        if (element == null) {
            for (int i = 0; i < size; i++) {
                if (node.element == null) return i;
                node = node.next;
            }
        }else {
            for (int i = 0; i < size; i++) {
                if (element.equals(node.element)) return i;
                node = node.next;
            }
        }
        return ELEMENT_NOT_FOUND;
    }
    
    /**
     * 获取index位置对应的节点对象
     * size >> 1  等于size/2
     * size << 2  等于size*2
     */
    private Node<E> node(int index) {
        rangeCheck(index);
        
        if (index < (size >> 1)) {
            Node<E> node = first;
            for (int i = 0; i < index; i++) {
                node = node.next;
            }
            return node;
        }else {
            Node<E> node = last;
            for (int i = size - 1; i > index; i--) {
                node = node.prev;
            }
            return node;
        }
    }
    
    private void outOfBounds(int index) {
        throw new IndexOutOfBoundsException("Index:" + index + ",size:" + size);
    }
    
    private void rangeCheck(int index) {
        // TODO Auto-generated method stub
        if (index < 0 || index >= size) {
            outOfBounds(index);
        }
    }
    
    public void rangeCheekForAdd(int index) {
        // TODO Auto-generated constructor stub
        if (index < 0 || index > size) {
            outOfBounds(index);
        }
    }
    
    @Override
    public String toString() {
        // TODO Auto-generated method stub
        StringBuilder stringBuilder = new StringBuilder();
        stringBuilder.append("size=").append(size).append(",[");
        Node<E> node = first;
        for (int i = 0; i < size; i++) {
            if (i != 0) {
                stringBuilder.append(", ");
            }
            stringBuilder.append(node.element);
            node = node.next;
        }
        stringBuilder.append("]");
        return stringBuilder.toString();
    }
    
}

---

总结：