838. Design Linked List¶

Difficulty: Medium

838. Design Linked List

Medium

Design your implementation of the linked list. You can choose to use a singly or doubly linked list.
A node in a singly linked list should have two attributes: val and next. val is the value of the current node, and next is a pointer/reference to the next node.
If you want to use the doubly linked list, you will need one more attribute prev to indicate the previous node in the linked list. Assume all nodes in the linked list are 0-indexed.

Implement the MyLinkedList class:

MyLinkedList() Initializes the MyLinkedList object.
int get(int index) Get the value of the index^th node in the linked list. If the index is invalid, return -1.
void addAtHead(int 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.
void addAtTail(int val) Append a node of value val as the last element of the linked list.
void addAtIndex(int index, int val) Add a node of value val before the index^th node in the linked list. If index equals the length of the linked list, the node will be appended to the end of the linked list. If index is greater than the length, the node will not be inserted.
void deleteAtIndex(int index) Delete the index^th node in the linked list, if the index is valid.

Example 1:

Input
["MyLinkedList", "addAtHead", "addAtTail", "addAtIndex", "get", "deleteAtIndex", "get"]
[[], [1], [3], [1, 2], [1], [1], [1]]
Output
[null, null, null, null, 2, null, 3]

Explanation
MyLinkedList myLinkedList = new MyLinkedList();
myLinkedList.addAtHead(1);
myLinkedList.addAtTail(3);
myLinkedList.addAtIndex(1, 2);    // linked list becomes 1->2->3
myLinkedList.get(1);              // return 2
myLinkedList.deleteAtIndex(1);    // now the linked list is 1->3
myLinkedList.get(1);              // return 3

Constraints:

0 <= index, val <= 1000
Please do not use the built-in LinkedList library.
At most 2000 calls will be made to get, addAtHead, addAtTail, addAtIndex and deleteAtIndex.

Solution¶

class MyLinkedList {
    static class Node {
        int data;
        Node next;
        public Node(int data) {
            this.data = data;
            next = null;
        }
    }
    private Node head;
    public MyLinkedList() {
        head = null;
    }
    public int get(int index) {
        if (index >= getSize()) return -1;
        int current_ind = 0;
        Node temp = head;
        while (current_ind != index) {
            temp = temp.next;
            current_ind++;
        }
        return temp.data;
    }
    public void addAtHead(int val) {
        if (head == null) {
            head = new Node(val);
            return;
        }
        Node New_Node = new Node(val);
        New_Node.next = head;
        head = New_Node;
    }
    public void addAtTail(int val) {
        if (head == null) {
            head = new Node(val);
            return;
        }
        Node Temp = head;
        while (Temp.next != null) {
            Temp = Temp.next;
        }
        Node New_Node = new Node(val);
        Temp.next = New_Node;
        New_Node.next = null;
    }
    public void addAtIndex(int index, int val) {
        if (index == 0) {
            addAtHead(val);
            return;
        }
        if (index == getSize()) {
            addAtTail(val);
            return;
        }
        if (index > getSize()) return;
        int current_ind = 0;
        Node prev = head;
        Node next = head;
        while (current_ind != index) {
            prev = next;
            next = next.next;
            current_ind++;
        }
        Node New_Node = new Node(val);
        prev.next = New_Node;
        New_Node.next = next;
    }
    public void deleteAtIndex(int index) {
        if (index == 0 && head == null) return;
        if (index == 0) {
            head = head.next;
            return;
        }
        if (index >= getSize()) return;
        int current_ind = 0;
        Node prev = head;
        Node next = head;
        while (current_ind != index) {
            prev = next;
            next = next.next;
            current_ind++;
        }
        prev.next = next.next;
    }
    private int getSize() {
        int size = 0;
        Node temp = head;
        while (temp != null) {
            size++;
            temp = temp.next;
        }
        return size;
    }
}
/**
 * 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);
 */

Complexity Analysis¶

Time Complexity: O(?)
Space Complexity: O(?)

Approach¶

Detailed explanation of the approach will be added here