record/problems/design_linked_list/solution.java
<reponame>bboxlin/algorithm<filename>record/problems/design_linked_list/solution.javaclass MyLinkedList { //cur here acutally is prev
    static class ListNode {
        int val;
        ListNode next;
        public ListNode(int val) { this.val = val; }
    }

    ListNode head;
    int size;

    /** Initialize your data structure here. */
    public MyLinkedList() {
        size = 0;
        head = new ListNode(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 >= size) return -1;

        ListNode cur = head;
        for(int i = 0; i < index + 1; i++) {
            cur = cur.next;
        }

        return cur.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) {
        addAtIndex(0, val);
    }

    /** Append a node of value val to the last element of the linked list. */
    public void addAtTail(int val) {
        addAtIndex(size, val);
    }

    /** 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 > size) return;

        if (index < 0) index = 0;

        ++size;

        ListNode cur = head;
        for (int i = 0; i < index; ++i) {
            cur = cur.next;
        }
        ListNode newNode = new ListNode(val);
        newNode.next = cur.next;
        cur.next = newNode;
    }

    /** Delete the index-th node in the linked list, if the index is valid. */
    public void deleteAtIndex(int index) {
        if (index < 0 || index >= size) return;

        ListNode cur = head;

        size--;
        for (int i = 0; i < index; ++i) {
            cur = cur.next;
        }
        cur.next = cur.next.next;
        // ListNode q = cur.next;
        // cur.next = q.next;
    }
}