-
Notifications
You must be signed in to change notification settings - Fork 0
/
112. 删除排序链表中的重复元素.cpp
79 lines (78 loc) · 1.83 KB
/
112. 删除排序链表中的重复元素.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
/**
* 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
// if(head == NULL)
// return NULL;
// ListNode *p = head;
// ListNode *q = head;
// int x = p->val;
// ListNode *temp;
// p = p->next;
// while(p != NULL)
// {
// if(p->val == x)
// {
// temp = p;
// q->next = p->next;
// p = p->next;
// delete temp;
// }
// else
// {
// x = p->val;
// q = p;
// p = p->next;
// }
// }
// return head;
// }
// };
class Solution {
public:
/**
* @param head: The first node of linked list.
* @return: head node
*/
ListNode *deleteDuplicates(ListNode *head) {
// write your code here
if(head == NULL)
return NULL;
ListNode *p = head->next;
ListNode *prior = head;
int cmp = head->val;
while(p!=NULL)
{
if(p->val == cmp)
{
ListNode *temp = p->next;
prior->next = temp;
delete p;
p = temp;
}
else
{
cmp = p->val;
prior = p;
p = p->next;
}
}
return head;
}
};