83. Remove Duplicates from Sorted List

最新推荐文章于 2025-09-13 19:30:09 发布

weixin_30483697

最新推荐文章于 2025-09-13 19:30:09 发布

阅读量59

点赞数

CC 4.0 BY-SA版权

文章标签： c/c++ runtime

原文链接：http://www.cnblogs.com/ruruozhenhao/p/9848411.html

本文提供了一种从已排序链表中删除所有重复元素的方法，确保每个元素仅出现一次。通过使用虚拟头节点简化边界条件，算法遍历链表并跳过重复元素，最终返回更新后的链表头。该实现效率较高，运行时间为12毫秒，优于36.37%的C++在线提交。

Given a sorted linked list, delete all duplicates such that each element appear only once.

Example 1:

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

Example 2:

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

my 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) {
            int sameNum = p->next->val;   
            p = p->next;
            while (p->next!= NULL && p->next->val == sameNum) {
                if (p->next->next != NULL)
                    p->next = p->next->next;
                else 
                    p->next = NULL;
            }
        }
        return dummy->next;
    }
};

Runtime: 12 ms, faster than 36.37% of C++ online submissions for Remove Duplicates from Sorted List.

转载于:https://www.cnblogs.com/ruruozhenhao/p/9848411.html