forked from cpselvis/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsolution083.cpp
More file actions
60 lines (53 loc) · 1.08 KB
/
solution083.cpp
File metadata and controls
60 lines (53 loc) · 1.08 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
/**
* Remove Duplicates from Sorted List
* Dummy head;
*
* cpselvis([email protected])
* August 24th, 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) {
ListNode *dummy = new ListNode(-1);
dummy -> next = head;
ListNode *prev = dummy;
int prevVal;
while (head != NULL)
{
ListNode *next = head -> next;
if (prevVal != head -> val)
{
prevVal = head -> val;
prev = head;
}
else
{
prev -> next = next;
}
head = head -> next;
}
return dummy -> next;
}
};
int main(int argc, char **argv)
{
ListNode *l1 = new ListNode(-1);
l1 -> next = new ListNode(0);
l1 -> next -> next = new ListNode(0);
l1 -> next -> next -> next = new ListNode(0);
l1 -> next -> next -> next -> next = new ListNode(3);
Solution s;
ListNode *l2 = s.deleteDuplicates(l1);
while (l2 != NULL)
{
cout << l2 -> val << endl;
l2 = l2 -> next;
}
}