0%

面试题 02.01. 移除重复节点

面试题 02.01. 移除重复节点

借助set
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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeDuplicateNodes(ListNode* head) {
ListNode* pseudoHead = new ListNode();
ListNode* ret = pseudoHead;
unordered_set<int> set;
while(head)
{
if(set.emplace(head->val).second)
{
pseudoHead->next = head;
pseudoHead = pseudoHead->next;
}
head = head->next;
}
pseudoHead->next = nullptr;
return ret->next;
}
};

T(n) : O(n)

S(n) : O(n)

不用set(遍历好多次)
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
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* removeDuplicateNodes(ListNode* head) {
auto point = head;
while(point)
{
auto pre = point;
auto cur = point->next;
while(cur)
{
if(cur->val == point->val)
{
pre->next = cur->next;
cur = cur->next;
}else
{
pre = pre->next;
cur = cur->next;
}
}
point = point->next;
}
return head;
}
};

T(n) : O(n^2)

S(n) : O(1)