-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRemove_Duplicate.cpp
More file actions
75 lines (65 loc) · 1.41 KB
/
Copy pathRemove_Duplicate.cpp
File metadata and controls
75 lines (65 loc) · 1.41 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
#include <bits/stdc++.h>
using namespace std;
class Node {
public:
int val;
Node* next;
Node(int val) {
this->val = val;
this->next = NULL;
}
};
void insertAtTail(Node *&head, Node *&tail, int val){
Node * newNode = new Node(val);
if (head == NULL)
{
head = newNode;
tail = newNode;
return;
}
tail->next = newNode;
tail = newNode;
}
void removeDuplicate(Node *head){
Node *temp = head;
while (temp != NULL && temp->next != NULL)
{
Node *nestedTemp = temp;
while (nestedTemp->next != NULL)
{
if (temp->val == nestedTemp->next->val)
{
Node *deleteNode = nestedTemp->next;
nestedTemp->next = nestedTemp->next->next;
delete deleteNode;
}
else{
nestedTemp = nestedTemp->next;
}
}
temp = temp->next;
}
}
void printLinkedList( Node* head){
Node* temp = head;
while (temp != NULL)
{
cout << temp->val << " ";
temp = temp->next;
}
cout << endl;
}
int main () {
Node * head = NULL;
Node * tail = NULL;
int v;
while (true)
{
cin >> v;
if (v == -1) break;
insertAtTail(head,tail,v);
}
removeDuplicate(head);
printLinkedList(head);
return 0;
}