-
Notifications
You must be signed in to change notification settings - Fork 75
/
Copy pathQ40_remove_duplicates_from_singly_linkedlist.cpp
80 lines (68 loc) · 1.44 KB
/
Q40_remove_duplicates_from_singly_linkedlist.cpp
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
78
79
80
// Program to remove duplicates in singly linkedlist
#include<bits/stdc++.h>
using namespace std;
class LinkedList
{
public:
int data;
LinkedList *next;
LinkedList(int x)
{
data = x;
next = NULL;
}
};
// fuction to remove duplicates
LinkedList *removeduplicates(LinkedList *head)
{
if(head == NULL)
return head;
set<int> s;
LinkedList *curr=head;
LinkedList *prev=NULL;
while(curr!=NULL)
{
if(s.find(curr->data)!=s.end())
{
prev->next=curr->next;
delete(curr);
}
else
{
s.insert(curr->data);
prev=curr;
}
curr=curr->next;
}
return head;
}
void printlist(LinkedList *head)
{
while(head)
{
cout<<head->data<<" ";
head=head->next;
}
}
int main()
{
LinkedList *head=new LinkedList(10);
LinkedList *curr = head;
curr->next = new LinkedList(30);
curr = curr->next;
curr->next = new LinkedList(20);
curr = curr->next;
curr->next = new LinkedList(40);
curr = curr->next;
curr->next = new LinkedList(20);
curr = curr->next;
curr->next = new LinkedList(30);
curr = curr->next;
curr->next = new LinkedList(50);
curr = curr->next;
curr->next = new LinkedList(50);
curr = curr->next;
//printlist(head);
LinkedList *temp = removeduplicates(head);
printlist(temp);
}