菜鸟成长逆袭之旅,爱好撸铁和撸代码,有强制的约束力,希望通过自己的努力做一个高品质人
Work together and make progress together
删除排序链表中的重复元素 II
给定一个排序链表,删除所有含有重复数字的节点,只保留原始链表中 没有重复出现 的数字。
示例 1:
输入: 1->2->3->3->4->4->5
输出: 1->2->5
示例 2:
输入: 1->1->1->2->3
输出: 2->3
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
if (!head || !head->next) return head;
ListNode *dummy = new ListNode(-1) , *pre = dummy;
dummy->next = head;
while(pre->next){
ListNode *cur = pre->next;
while(cur->next && cur->next->val == cur->val){
cur = cur->next;
}
if(cur != pre->next) pre->next = cur->next;
else pre = pre->next;
}
return dummy->next;
}
};
*/
class Solution{
public:
ListNode* deleteDuplicates(ListNode* head){
if (!head) return head;
if(head->next && head->val == head->next->val){
while (head->next && head->val == head->next-val){
head = head->next;
}
return deleteDuplicates(head->next);
}
head->next = deleteDuplicates(head->next);
return head;
}
};