链表——双链表

概述

如果懂了单链表的基本操作，相信双链表也没有问题，它们之间唯一的差别便是结点多了一个指向前驱结点的指针域。单链表的实现可参考：单链表的实现

具体代码实现

class MyLinkedList {
    
    /** Initialize your data structure here. */
    
    public Node dummyNode;
    public Node dummyNodeTail;
    public int length;
    
    class Node {
        int val;
        Node prev;
        Node next;
        
        Node(){};
    
        Node(int val) {
            this.val = val;
            this.next = null;
            this.prev = null;
        }
    }
    
    
    public MyLinkedList() {
        dummyNode = new Node();
        dummyNodeTail = new Node();
        dummyNode.next = dummyNodeTail;
        dummyNodeTail.prev = dummyNode;
        length = 0;
    }
    
    /** Get the value of the index-th node in the linked list. If the index is invalid, return -1. */
    public int get(int index) {
        if(index<0||index>length-1)
            return -1;
        Node current = dummyNode.next;
        for(int i = 0;i<index;i++){
            current = current.next;
        }
        return current.val;
    }
    
    /** Add a node of value val before the first element of the linked list. After the insertion, the new node will be the first node of the linked list. */
    public void addAtHead(int val) {
        Node current = dummyNode;
        Node newNode = new Node(val);
        newNode.next = dummyNode.next;
        dummyNode.next.prev = newNode;
        newNode.prev = dummyNode;
        dummyNode.next = newNode;
        length++;
    }
    
    /** Append a node of value val to the last element of the linked list. */
    public void addAtTail(int val) {
        Node current = dummyNode;
        Node newNode = new Node(val);
        for(int i = 0;i<length;i++){
            current = current.next;
        }
        current.next = newNode;
        newNode.prev = current;
        newNode.next = dummyNodeTail;
        dummyNodeTail.prev = newNode;
        length++;
    }
    
    /** Add a node of value val before the index-th node in the linked list. If index equals to the length of linked list, the node will be appended to the end of linked list. If index is greater than the length, the node will not be inserted. */
    public void addAtIndex(int index, int val) {
        if(index<=length){
            if(index<=0)
                addAtHead(val);
            else {
                Node current = dummyNode;
                Node newNode = new Node(val);
                for(int i = 0;i<index;i++){
                    current = current.next;
                }
                newNode.next = current.next;
                current.prev = newNode;
                newNode.prev = current;
                current.next = newNode;
                length++;
            }
        }
            
        
    }
    
    /** Delete the index-th node in the linked list, if the index is valid. */
    public void deleteAtIndex(int index) {
        if(index>=0&&index<length){
            Node current = dummyNode;
            for(int i = 0;i<index;i++ ){
                current = current.next;
            }
            current.next = current.next.next;
            current.next.prev = current;
            length--;
        }
    }
}

/**
 * Your MyLinkedList object will be instantiated and called as such:
 * MyLinkedList obj = new MyLinkedList();
 * int param_1 = obj.get(index);
 * obj.addAtHead(val);
 * obj.addAtTail(val);
 * obj.addAtIndex(index,val);
 * obj.deleteAtIndex(index);
 */