-
Notifications
You must be signed in to change notification settings - Fork 0
/
113. 删除排序链表中的重复数字 II .cpp
104 lines (101 loc) · 2.32 KB
/
113. 删除排序链表中的重复数字 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
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
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
/**
* Definition of ListNode
* class ListNode {
* public:
* int val;
* ListNode *next;
* ListNode(int val) {
* this->val = val;
* this->next = NULL;
* }
* }
*/
// class Solution{
// public:
// /**
// * @param head: The first node of linked list.
// * @return: head node
// */
// ListNode * deleteDuplicates(ListNode *head) {
// // write your code here
// ListNode *newHead = new ListNode(0);
// newHead->next = head;
// ListNode *start = newHead;
// ListNode *p = head;
// ListNode *q = NULL;
// ListNode *s = NULL;
// ListNode *temp = NULL;
// bool flag = false;
// while(p!=NULL)
// {
// q = p->next;
// s = p;
// while(q!=NULL)
// {
// temp = q->next;
// if(q->val == p->val)
// {
// s->next= temp;
// flag = true;
// delete q;
// }
// else
// s = q;
// q = temp;
// }
// temp = p->next;
// if(flag == true)
// {
// start->next = temp;
// flag = false;
// delete p;
// }
// else
// start = p;
// p = temp;
// }
// temp = newHead->next;
// delete newHead;
// return temp;
// }
// };
class Solution{
public:
/**
* @param head: The first node of linked list.
* @return: head node
*/
ListNode * deleteDuplicates(ListNode *head) {
// write your code here
map<int, int> m;
ListNode *p = head;
while(p!=NULL)
{
m[p->val]++;
p = p->next;
}
p = head;
ListNode *list_head = new ListNode(0);
list_head->next = head;
ListNode *prior = list_head;
ListNode *temp;
while(p!=NULL)
{
if(m[p->val]>1)
{
prior->next = p->next;
temp = p->next;
free(p);
p = temp;
}
else
{
prior = p;
p = p->next;
}
}
temp = list_head->next;
delete list_head;
return temp;
}
};