zoukankan      html  css  js  c++  java
  • 82. 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.

    Example 1:

    Input: 1->2->3->3->4->4->5
    Output: 1->2->5
    

    Example 2:

    Input: 1->1->1->2->3
    Output: 2->3

    AC code:

    /**
     * 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) {
            ListNode* dummy = new ListNode(0);
            dummy->next = head;
            ListNode* p = dummy;
            while (p->next != NULL && p->next->next != NULL) {
                if (p->next->val == p->next->next->val) {
                    int sameNum = p->next->val;
                    while (p->next != NULL && p->next->val == sameNum)
                        p->next = p->next->next;
                } else {
                    p = p->next;
                }
            }
            return dummy->next;
        }
    };
    

    Runtime: 4 ms, faster than 100.00% of C++ online submissions for Remove Duplicates from Sorted List II.

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    jQuery之选择器
    JAVA之网页截屏
    AJAX之JSON
    JSP之AJAX
    JSP之邮箱检验
    【16】LRUChache
    hashmap与currentHashMap
    Day1 工厂模式
    D0 设计模式
    【15】【有点特殊的dp】 剪绳子
  • 原文地址:https://www.cnblogs.com/h-hkai/p/9845054.html
Copyright © 2011-2022 走看看