Leetcode - List - Remove Duplicates from Sorted List

最新推荐文章于 2025-01-18 14:22:19 发布

原创最新推荐文章于 2025-01-18 14:22:19 发布 · 358 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

Leetcode 专栏收录该内容

30 篇文章

订阅专栏

本文介绍如何在保持链表排序的情况下，移除所有重复的节点，确保每个元素只出现一次。

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

For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->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==NULL)
            return NULL;
        ListNode *prev=head;
        ListNode *cur=head->next;
        while(cur!=NULL)
        {
            if(cur->val==prev->val)
            {
                prev->next=cur->next;
                delete cur;
                cur=prev->next;
            }
            else
            {
                prev=cur;
                cur=cur->next;
            }
        }
        return head;
    }
};