LeetCode 0082 - Remove Duplicates from Sorted List II

Reck Zhang

发布于 2021-08-11 10:50:10

1600

发布于 2021-08-11 10:50:10

文章被收录于专栏：Reck Zhang

Remove Duplicates from Sorted List II

Desicription

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

For example, Given 1->2->3->3->4->4->5, return 1->2->5.

Given 1->1->1->2->3, return 2->3.

Solution

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
trueListNode* deleteDuplicates(ListNode* head) {
        ListNode* fake_head = new ListNode(0);
        fake_head->next = head;
        ListNode* pre = fake_head;
        ListNode* now = head;
        while(now){
            while(now->next && now->val == now->next->val)
                now = now->next;
            if(pre->next == now)
                pre = pre->next;
            else
                pre->next = now->next;
            now = now->next;
        }
        return fake_head->next;
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2017-11-20，如有侵权请联系 cloudcommunity@tencent.com 删除

distinct