题目描述
思路分析
链表模拟题。
代码实现
/**
* 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(-100);
dummy->next=head;
auto p=dummy,q=dummy;
while(q&&q->next){
auto r=q->next;
while(r&&q->val==r->val) r=r->next;
p=p->next=r;
q=r;
}
return dummy->next;
}
};