-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRemove Duplicate.cpp
More file actions
84 lines (71 loc) · 1.29 KB
/
Remove Duplicate.cpp
File metadata and controls
84 lines (71 loc) · 1.29 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
78
79
80
81
82
83
84
#include <bits/stdc++.h>
using namespace std;
class Node
{
public:
int val;
Node *next;
Node(int val)
{
this->val = val;
this->next = NULL;
}
};
// Insert value at the end
void insert_data_end(Node *&head, Node *&tail, int val)
{
Node *newNode = new Node(val);
if (head == NULL)
{
head = tail = newNode;
return;
}
tail->next = newNode;
tail = newNode;
}
// Remove duplicate values
void remove_duplicates(Node *head)
{
Node *current = head;
while (current != NULL)
{
Node *temp = current;
while (temp->next != NULL)
{
if (temp->next->val == current->val)
{
Node *duplicate = temp->next;
temp->next = temp->next->next;
delete duplicate;
}
else
{
temp = temp->next;
}
}
current = current->next;
}
}
// Print the linked list
void print_list(Node *head)
{
while (head != NULL)
{
cout << head->val;
if (head->next != NULL)
cout << " ";
head = head->next;
}
}
int main()
{
Node *head = NULL;
Node *tail = NULL;
// Input until -1
int x;
while (cin >> x && x != -1)
insert_data_end(head, tail, x);
remove_duplicates(head);
print_list(head);
return 0;
}