-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathRemove Duplicates from Sorted List II.cpp
55 lines (55 loc) · 1.56 KB
/
Remove Duplicates from Sorted List II.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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
ListNode *temp = head;
ListNode *newHead = NULL, *newEnd = NULL;
map<int, int> mp;
while(temp)
{
if(temp->next != NULL && temp->val != temp->next->val)
{
if(newEnd == NULL)
{
newEnd = new ListNode(temp->val);
newHead = newEnd;
}
else
{
newEnd->next = new ListNode(temp->val);
newEnd = newEnd->next;
}
temp = temp->next;
}
else
{
int value = temp->val;
if(temp->next == NULL)
{
if(newEnd == NULL)
{
newEnd = new ListNode(temp->val);
newHead = newEnd;
}
else
{
newEnd->next = new ListNode(temp->val);
newEnd = newEnd->next;
}
}
while(temp != NULL && value == temp->val)
temp = temp->next;
}
}
return newHead;
}
};