zoukankan      html  css  js  c++  java
  • Remove Duplicates from Sorted List II

    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.

    Code:

    class Solution {
    public:
        ListNode *deleteDuplicates(ListNode *head) {
            if(head==NULL) return head;
            ListNode *start=new ListNode(0);
            start->next=head;
            ListNode *pre=start;
            ListNode *cur=head;
            ListNode *nex=head->next;
            bool detect=false;
            while(nex){
                if(nex->val==cur->val){
                    detect=true;
                    cur->next=nex->next;
                    delete nex;
                }
                else if(detect){
                    detect=false;
                    pre->next=cur->next;
                    delete cur;
                    cur=nex;
                }
                else{
                    pre=cur;
                    cur=nex;
                }
                nex=nex->next;
            }
            if(detect){
                pre->next=NULL;
                delete cur;
            }
            head=start->next;
            delete start;
            return head;
        }
    };
  • 相关阅读:
    Quick Find
    并查集
    树形问题和更多树
    二叉搜索树的局限性
    Oracle Auto Increment Column
    测试机器性能
    EXP/IMP version
    python getaddrinfo 函数
    open cursor too much error
    要看的一些链接
  • 原文地址:https://www.cnblogs.com/winscoder/p/3408996.html
Copyright © 2011-2022 走看看