Design Linked List - The Coding Shala

Home >> Data Structure >> Design Linked List

Design Linked List

Problem:

Design your implementation of the linked list. You can choose to use them a singly linked list or the 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 these functions in your linked list class:



get(index): Get the value of the index-th node in the linked list. If the index is invalid, return -1.

addAtHead(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.

addAtTail(val): Append a node of value val to the last element of the linked list.

addAtIndex(index, val): Add a node of value val before the index-th node in the linked list. If the index equals the length of the linked list, the node will be appended to the end of the linked list. If the index is greater than the length, the node will not be inserted. If the index is negative, the node will be inserted at the head of the list.

deleteAtIndex(index) : Delete the index-th node in the linked list, if the index is valid.

Example:



MyLinkedList linkedList = new MyLinkedList();

linkedList.addAtHead(1);
linkedList.addAtTail(3);
linkedList.addAtIndex(1, 2);  // linked list becomes 1->2->3
linkedList.get(1);            // returns 2
linkedList.deleteAtIndex(1);  // now the linked list is 1->3
linkedList.get(1);            // returns 3
Note:

All values will be in the range of [1, 1000].
The number of operations will be in the range of [1, 1000].
Please do not use the built-in LinkedList library.

Design Linked List Java Solution

Approach
we can use a singly linked list or doubly linked list.

Java 

class MyLinkedList {
    
    class Node{
        int value;
        Node next;
        Node(int val){
            this.value = val;
        }
    }
    
    Node head;
    int size;
    
    /** Initialize your data structure here. */
    public MyLinkedList() {
        head = null;
        size = 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;
        Node tmp = head;
        for(int i = 0; i<=size; i++){
            if(i == index){
                return tmp.value;
            }
            tmp = tmp.next;
        }
        return -1;
    }
    
    /** 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 nw = new Node(val);
        nw.next = head;
        head = nw;
        size++;
    }
    
    /** Append a node of value val to the last element of the linked list. */
    public void addAtTail(int val) {
        Node nw = new Node(val);
        Node tmp = head;
        for(int i = 0; i<size-1;i++) tmp = tmp.next;
        tmp.next = nw;
        nw.next = null;
        size++;
    }
    
    /** 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) {
        Node nw = new Node(val);
        if(index > size) return;
        if(index == 0 || index<0){
            nw.next = head;
            head = nw;
            size++;
        }else if(index == size){
            Node tmp = head;
            while(tmp.next != null) tmp = tmp.next;
            tmp.next = nw;
            nw.next = null;
            size++;
        }else{
            Node tmp = head;
            for(int i = 0; i<=index; i++){
                if(i == index-1){
                    nw.next = tmp.next;
                    tmp.next = nw;
                    size++;
                }
                tmp = tmp.next;
            }
        }
    }
    
    /** Delete the index-th node in the linked list, if the index is valid. */
    public void deleteAtIndex(int index) {
       if(index <0) return;
        Node tmp = head;
        int i = 0;
        if(index == 0) { head = head.next; size--; }
        else{
        while(i<index-1 && i<size){
            tmp = tmp.next;
            i++;
        }
        if(i < size && tmp.next != null){
            if(tmp.next.next == null) tmp.next = null;
            else{
                tmp.next = tmp.next.next;
            }
            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);
 */


Approach 2:
Using the doubly linked list.

Java
class MyLinkedList {
    //using doubly linked list
    class Node{
        int value;
        Node next,prev;
        Node(int val){
            this.value = val;
        }
    }
    
    Node head;
    int size;
    
    /** Initialize your data structure here. */
    public MyLinkedList() {
        head = null;
        size = 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;
        Node tmp = head;
        for(int i = 0; i<=size; i++){
            if(i == index){
                return tmp.value;
            }
            tmp = tmp.next;
        }
        return -1; 
    }
    
    /** 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 nw = new Node(val);
        nw.next = head;
        nw.prev = null;
        head = nw;
        size++;
    }
    
    /** Append a node of value val to the last element of the linked list. */
    public void addAtTail(int val) {
        Node nw = new Node(val);
        Node tmp = head;
        for(int i = 0; i<size-1;i++) tmp = tmp.next;
        tmp.next = nw;
        nw.next = null;
        nw.prev = tmp;
        size++;
    }
    
    /** 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) {
        Node nw = new Node(val);
        if(index > size) return;
        if(index == 0 || index<0){
            nw.next = head;
            nw.prev = null;
            head = nw;
            size++;
        }else if(index == size){
            Node tmp = head;
            while(tmp.next != null) tmp = tmp.next;
            tmp.next = nw;
            nw.next = null;
            nw.prev = tmp;
            size++;
        }else{
            Node tmp = head;
            for(int i = 0; i<=index; i++){
                if(i == index-1){
                    nw.next = tmp.next;
                    nw.prev = tmp;
                    tmp.next.prev = nw;
                    tmp.next = nw;
                    size++;
                }
                tmp = tmp.next;
            }
        } 
    }
    
    /** Delete the index-th node in the linked list, if the index is valid. */
    public void deleteAtIndex(int index) {
       if(index <0) return;
        Node tmp = head;
        int i = 0;
        if(index == 0) { head = head.next; size--; }
        else{
        while(i<index-1 && i<size){
            tmp = tmp.next;
            i++;
        }
        if(i < size && tmp.next != null){
            if(tmp.next.next == null) tmp.next = null; //check here
            else{
                tmp.next = tmp.next.next;
                tmp.next.prev = tmp;
            }
            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);
 */



Other Posts You May Like
Please leave a comment below if you like this post or found some error, it will help me to improve my content.
By

Comments

Post a Comment

Popular Posts from this Blog

Shell Script to find sum, product and average of given numbers - The Coding Shala

Home >> Scripting >> Sum, product and average Shell Script to find the sum, product, and the average of given numbers Read four integer numbers from the user and find the sum, product, and average of these four numbers? Code:  #! / bin / bash echo "enter four integers" read a b c d sum =$(echo "$a + $b + $c + $d" | bc - l) average=$(echo "$sum / 4" | bc - l) product=$(echo "$a * $b * $c * $d" | bc - l) echo "sum = $sum" echo "Average = $average" echo "Product = $product" Other Posts You May Like Shell script to print sum of the digits of a number Shell Script to print number in descending order Shell script to find out biggest number from three numbers Shell script to find out factorial of a number Shell Script to create a simple calculator Please leave a comment below if you like this post or found some error, it will help me to improve my content.
Read more

Add two numbers in Scala - The Coding Shala

Home >> Learn Scala >> Add Two Numbers  In this post, we will learn how to write a Scala program to Add Two Numbers. Add Two Numbers in Scala The following is the Scala program to Add two Numbers. Scala Program:  //add two numbers in scala //the coding shala object Main { def main ( args : Array [ String ]){ //we can take user input also val num1 = 10 ; val num2 = 20 ; //add both numbers val result = num1 + num2 ; println ( "Sum of " + num1 + " + " + num2 + " = " + result ); } } Other Posts You May Like Scala - Hello World Program Java - Hello World Program Power of Two Simple XML Validator Fibonacci Series Please leave a comment below if you like this post or found some errors, it will help me to improve my content.
Read more

Shell Script to Create a Simple Calculator - The Coding Shala

Home >> Scripting >> simple calculator Shell Script to Create a Simple Calculator Write a shell script to create a simple calculator using a switch-case statement? Code:  #! / bin / bash echo "simple calculator" sum = 0 i = "y" echo "enter first number" read n1 echo "enter second number" read n2 while [ $ i = "y" ] do echo "1.Addition" echo "2.Subtraction" echo "3.Multiplication" echo "4.Division" echo "Enter choice" read ch case $ch in 1 ) sum =$(echo " $n1 + $n2" | bc - l) echo "Addition is =" $ sum ;; 2 ) sum =$(echo "$n1 - $n2" | bc - l) echo "Sub is =" $ sum ;; 3 ) sum =$(echo "$n1 * $n2" | bc - l) echo "Mul is =" $ sum ;; 4 ) sum =$(echo "$n1 / $n2" | bc - l) echo "div is =" $ sum ;; * )echo "invalid choice" esac echo "Do y
Read more

Goal Parser Interpretation LeetCode Solution - The Coding Shala

Home >> LeetCode >> Goal Parser Interpretation  In this post, we will learn how to solve LeetCode's Goal Parser Interpretation Problem and will implement its solution in Java. Goal Parser Interpretation Problem You own a Goal Parser that can interpret a string command. The command consists of an alphabet of "G", "()", and/or "(al)" in some order. The Goal Parser will interpret "G" as the string "G", "()" as the string "o", and "(al)" as the string "al". The interpreted strings are then concatenated in the original order. Given the string command, return the Goal Parser's interpretation of the command. Example 1: Input: command = "G()(al)" Output: "Goal" Explanation: The Goal Parser interprets the command as follows: G -> G () -> o (al) -> al The final concatenated result is "Goal". Example 2: Input: command = "G()()()()(al)&qu
Read more

New Year Chaos Solution - The Coding Shala

Home >> Programming Questions >> New Year Chaos New Year Chaos Problem Solution In this post, you will learn how to solve New Year Chaos Problem and implement its solution in Java. Problem:   It's New Year's Day and everyone's in line for the Wonderland rollercoaster ride! There are a number of people queued up, and each person wears a sticker indicating their initial position in the queue. Initial positions increment from at the front of the line to at the back.  Any person in the queue can bribe the person directly in front of them to swap positions. If two people swap positions, they still wear the same sticker denoting their original places in line. One person can bribe at most two others.  For Example, if n=8 and Person 5 bribes Person 4, the queue will look like this: 1,2,3,5,4,6,7,8. Fascinated by this chaotic queue, you decide you must know the minimum number of bribes that took place to get the queue into its current state. Input:
Read more