forked from cpselvis/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsolution082.cpp
More file actions
62 lines (55 loc) · 1.34 KB
/
solution082.cpp
File metadata and controls
62 lines (55 loc) · 1.34 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
/**
* Remove Duplicates from Sorted List II
*
* cpselvis([email protected])
* Oct 9th, 2016
*/
#include<iostream>
using namespace std;
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if (head == NULL || head -> next == NULL) return head;
ListNode *dummy = new ListNode(-1);
dummy -> next = head;
head = dummy;
while (head -> next != NULL && head -> next -> next != NULL)
{
if (head -> next -> val == head -> next -> next -> val)
{
int val = head -> next -> val;
while (head -> next != NULL && head -> next -> val == val)
{
head -> next = head -> next -> next;
}
}
else
{
head = head -> next;
}
}
return dummy -> next;
}
};
int main(int argc, char **argv)
{
ListNode *head = new ListNode(1);
head -> next = new ListNode(2);
head -> next -> next = new ListNode(3);
head -> next -> next -> next = new ListNode(3);
head -> next -> next -> next -> next = new ListNode(4);
head -> next -> next -> next -> next -> next = new ListNode(4);
head -> next -> next -> next -> next -> next -> next = new ListNode(5);
Solution s;
ListNode *node = s.deleteDuplicates(head);
while(node != NULL)
{
cout << node -> val << endl;
node = node -> next;
}
}