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.

    /**
     * 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* newHead = new ListNode(-1);
            newHead->next = head;
            ListNode* pre = newHead;
            ListNode* cur = head;
            bool duplicated = false;// if has duplicates
            while(cur->next){
                if(cur->val == cur->next->val){
                    cur = cur->next;
                    duplicated = true;
                }else{
                    if(duplicated){
                        while(pre->next != cur->next){
                            ListNode* tmp = pre->next;
                            pre->next = pre->next->next;
                            delete tmp;
                        }
                    //     pre->next = cur->next;
                        duplicated = false;
                    }else{
                        pre->next = cur;
                        pre = cur;
                    }
                    cur = cur->next;
                }
            }
            if(duplicated){
                pre->next = nullptr;
            }
            return newHead->next;
        }
    };
  • 相关阅读:
    主函数main
    static关键字
    this关键字
    构造函数
    封装
    匿名对象
    java基础积累
    JAVA相关知识复习
    ORACLE数据库表空间查询
    两个日期的时间差
  • 原文地址:https://www.cnblogs.com/wxquare/p/5928085.html
Copyright © 2011-2022 走看看