insert, delete and search operations on list

package linkedlist;

public class List {
   
   
    Node head = null;
   
    public  void insert(int data){

        Node new_node = new Node(data);
       
        new_node.next = head;
        head = new_node;
       
        return;
       
    }
   
    public void insertAtEnd(int data){
       
        Node new_node = new Node(data);
       
        if(head == null){
            head = new_node;
            return;
        }
       
        Node last = head;
       
        while(last.next != null){
            last = last.next;
        }
       
        last.next = new_node;
       
    }
   
    public void insetAfter(Node prev_node, int data){
        Node new_node = new Node(data);
       
        new_node.next = prev_node.next;
       
        prev_node.next = new_node;
       
        return;
       
    }
   
    public void delete(int data){
       
        Node temp = head;
        Node prev = null;
       
        // if head holds data since head don't have previous node
        if(temp != null && temp.data == data){
            temp = temp.next;
            return;
        }
       
        while(temp!= null && temp.data != data){
           
            prev = temp;
            temp = temp.next;
           
        }
       
        //if data is not present in the list
        if(temp == null)
            return;
       
        prev.next = temp.next;
       
        return;
       
    }
   
    public void delAtpos(int pos){
       
        Node temp = head;
        Node prev = null;
       
        if(head!= null && pos == 0){
            head = head.next;
        }
       
        for(int i=1; i<=pos && temp!=null; i++){
            prev = temp;
            temp = temp.next;
        }
       
        if(temp != null){
           
            prev.next = temp.next;
        }
       
        return;
       
    }
   
    public boolean search(int data){
       
        Node temp = head;
       
        while(temp!= null && temp.data != data){
            temp = temp.next;
        }
       
        if(temp != null){
            return true;
        }
       
        return false;
    }
   
    public boolean searchrecursively(Node node, int data){
        if(node == null){
            return false;
        }
       
        if(node.data == data){
            return true;
        }
       
     return    searchrecursively(node.next, data);
       
   
    }
   
   
    public void printList(){
       
        Node temp = head;
       
        while(temp.next!= null){
           
            System.out.print(temp.data+" ->");
            temp = temp.next;
        }
       
        System.out.print(temp.data);
       
        System.out.println();
       
        return;
    }
   
   
    public static void main(String[] args){
       
        List list = new List();
       
        list.head = new Node(1);
        list.head.next = new Node(2);
        list.head.next.next = new Node(3);
        list.printList();
       
        list.insert(5);
        list.insert(4);
        list.insertAtEnd(7);
        list.printList();
       
        list.delete(7);
        list.printList();
       
        list.delAtpos(3);
        list.printList();
       
        boolean res = list.searchrecursively(list.head, 9);
        System.out.println(res);
       
        res = list.search(3);
        System.out.println(res);
       
       
       
    }
   

}

Comments

Post a Comment

Popular posts from this blog

Rearrange Array in Maximum-Minimum form

Given a sorted array of positive integers, rearrange the array alternately i.e first element should be the maximum value, second minimum value, third-second max, fourth-second min and so on. Naive Solution: Here we will use an auxiliary array to store the elements in correct order. For even indices of the array  Large numbers from the given array are added. For odd indices small numbers are added. Code: import java.util.*; public class Test{        public static void main(String[] args) {          Scanner in = new Scanner(System.in);     int[] a = {1,2,3,4,5,6,7,8,9};     int n = a.length;     int[] temp = new int[n];     int small = 0;     int large = n-1;     for(int i=0; i<n; i++){         if(i%2 == 0){             temp[i] = a[large--];         }  ...
Read more

Find zeroes to be flipped so that number of consecutive 1's is maximized

Image
Input: arr[] = {1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1} m = 2 Output: 5 7 We are allowed to flip maximum 2 zeroes. If we flip arr[5] and arr[7], we get 8 consecutive 1's which is maximum possible under given constraints Input: arr[] = {1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1} m = 1 Output: 7 We are allowed to flip maximum 1 zero. If we flip arr[7], we get 5 consecutive 1's which is maximum possible under given constraints. Input: arr[] = {0, 0, 0, 1} m = 4 Output: 0 1 2 Since m is more than number of zeroes, we can flip all zeroes. Steps: It is based on sliding window method. The window at any time should consists of only m zeroes. If the zerocount is below m wr is incremented. If the zerocount is more wl is incremented. Code: import java.util.*; public class Solution {       public static void main(String[] args) {         int[] a = {1,1,0,1,1,0,0,1,1,1};         int m = 2;   ...
Read more

Count substrings with same first and last character

Given a string we have check contiguous substrings with same first and last characer. Input: abcab Output: 7 (a,abca,b,bcab, c, a, b) Naive Solution: T: O(n^2) S: O(1)      We initialize the count to length of the string as each and every element contribute to its length.       In the outer loop we will pick a element. In the inner loop we will compare it other elements and if they are equal we will increment the counter.  Code: import java.util.*; public class Solution {          public static void main(String[] args) {         String str = "aba";         char[] s = str.toCharArray();         int len = s.length;         int count = len;         for(int i=0; i<len-1; i++){             for(int j=i+1; j<len; j++){               ...
Read more