-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMore_Linked_Lists.java
More file actions
77 lines (74 loc) · 2.21 KB
/
More_Linked_Lists.java
File metadata and controls
77 lines (74 loc) · 2.21 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
import java.io.*;
import java.util.*;
class Node{
int data;
Node next;
Node(int d){
data=d;
next=null;
}
}
class Solution
{//--------------------------------------------------------------------------------------------------------------------
public static Node removeDuplicates(Node head)
{
//Write your code here
if(head==null) //if the list is empty..then simply return null value..(or head)
{
return head;
}
Node temp = head; //it will be used to traverse the linked list..
while(temp.next!=null) //untill it is null..
{
if(temp.data==temp.next.data)
{
Node t = temp.next.next; //creating new node which will point the next.next node..
temp.next.next = null; //next duplicate node will be then null..
temp.next = t; //earlier will point to the next.next node..
}
else
{
temp = temp.next; //if it is not equal then simply move forward..
}
}
return head; //At last simply return the head of the linked list..
}
//---------------------------------------------------------------------------------------------------------------------------
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);
}
}