Remove Duplicates from Sorted List

/**
 * 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) return NULL;
        if(!head->next) return head;
        
        ListNode *last = head;
        ListNode *cur = head->next;
        
        ListNode *dh = new ListNode(0);
        dh->next = head;
        
        ListNode *pre = dh;
        
        while(cur) {
            if(cur->val != last->val) {
                while(last->next != cur) {
                    last = last->next;
                    delete pre->next;
                    pre->next = last;
                }
                pre = last;
                last = cur;
            }
            cur = cur->next;
        }
        
        while(last->next != cur) {
            last = last->next;
            delete pre->next;
            pre->next = last;
        }
        
        cur = dh->next;
        delete dh;
        return cur;
    }
};

 

欢迎关注微信公众号——计算机视觉:

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值