链表设计

再不会我就是猪

package dynamic;

/**
 * @Author free-go
 * @Date Created in 19:18 2020/2/11
 **/
class MyLinkedList {
    ListNode head;
    ListNode last;
    int total;
    class ListNode {        //成员内部类
        ListNode next;
        int val;
        public ListNode (int val){
            this.val = val;
            this.next = null;
        }
    }
    /** Initialize your data structure here. */
    public MyLinkedList() {
        this.head = null;       //构造方法初始化
        this.last = head;
        this.total = 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 > total-1 || index < 0)return -1;     //先对index做判断，是否超出范围
        ListNode temp = head;
        for (int i = 0; i < index; i++){
            temp = temp.next;       //遍历，一个一个往后递进
        }
        return temp.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) {
        ListNode newHead = new ListNode(val);
        newHead.next = head;        //先将新节点的next链接到head
        if (head == null) last = newHead;
        head = newHead;     //再将head转移到newHead
        this.total++;
    }

    /** Append a node of value val to the last element of the linked list. */
    public void addAtTail(int val) {
        ListNode newLast = new ListNode(val);//与插入头结点是相反的操作
        last.next = newLast;
        last = newLast;
        this.total++;
    }

    /** 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 < 0 || index > total) return; //>total，因为最后一个的节点索引为total-1
        if (index == 0) {
            this.addAtHead(val);
            return;
        }
        if (index == total) {
            this.addAtTail(val);
            return;
        }
        ListNode newNode = new ListNode(val);
        ListNode pre = head;
        for (int i=0; i<index-1; i++) pre = pre.next;//遍历
        newNode.next = pre.next;
        pre.next = newNode;
        this.total++;
    }

    /** Delete the index-th node in the linked list, if the index is valid. */
    public void deleteAtIndex(int index) {
        if (index < 0 || index >= total || head == null) return;//先做判断
        if (index == 0) {
            if (head == last) last = last.next;     //做判断，当头尾节点相同
            head = head.next;
            this.total--;
            return;
        }
        ListNode pre = head;
        for (int i=0; i<index-1; i++) pre = pre.next;       //遍历
        if (index == total-1) last = pre;
        pre.next = pre.next.next;
        this.total--;
    }
}