Day 24 : Java 7 | More Linked Lists - Hackerrank.java

Day 24 : Java 7 | More Linked Lists - Hackerrank.java

import java.io.*;
import java.util.*;
class Node{
	int data;
	Node next;
	Node(int d){
        data=d;
        next=null;
    }
	
}
class Solution
{
    public static int prevData = 0;
    public static Node removeDuplicates(Node head) {
        //Write your code here 
        Node start = head;
        
        while(start.next != null){
            if(start.next.data == start.data){
                if(start.next.next != null){
                    start.next = start.next.next;
                }else{
                    if(start.next.data == start.data){
                        start.next = null;
                    }
                    break;
                }
            }else {
                start = start.next;
            }
        }
        
        return head;
    }
    
    public static  Node insert(Node head,int data)
    {
        Node p=new Node(data);			
        if(head==null)
            head=p;
        else if(head.next==null)
            head.next=p;
        else
        {
            Node start=head;
            while(start.next!=null)
                start=start.next;
            start.next=p;

        }
        return head;
    }
    public static void display(Node head)
        {
              Node start=head;
              while(start!=null)
              {
                  System.out.print(start.data+" ");
                  start=start.next;
              }
        }
        public static void main(String args[])
        {
              Scanner sc=new Scanner(System.in);
              Node head=null;
              int T=sc.nextInt();
              while(T-->0){
                  int ele=sc.nextInt();
                  head=insert(head,ele);
              }
              head=removeDuplicates(head);
              display(head);

       }
    }