给定一个已排序的链表的头 head , 删除原始链表中所有重复数字的节点,只留下不同的数字 。返回 已排序的链表 。
示例 1:
示例 2:
提示:
方法一:模拟
C++提交内容:
/**
* 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) {
if(!head){
return head;
}
ListNode* dummy = new ListNode(0, head);
ListNode* cur = dummy;
while(cur -> next && cur -> next -> next){
if(cur -> next -> val == cur -> next -> next -> val){
int x = cur -> next -> val;
while(cur -> next && cur -> next -> val == x){
cur -> next = cur -> next -> next;
}
}else{
cur = cur -> next;
}
}
return dummy->next;
}
};