LeetCode 82. 删除排序链表中的重复元素 II
题解
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode() : val(0), next(nullptr) {}
* ListNode(int x) : val(x), next(nullptr) {}
* ListNode(int x, ListNode *next) : val(x), next(next) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
auto dummy = new ListNode(-1);
dummy->next = head;
auto p = dummy;
while (p->next){
auto q = p->next;
while(q && q->val == p->next->val) q = q->next;
if (q == p->next->next) p = p->next;
else p->next = q;
}
return dummy->next;
}
};
- 这个想法类似于双指针吧