LeetCode Remove Duplicates from Sorted List II

coobj2008

于 2014-03-19 20:49:29 发布

阅读量322

点赞数

CC 4.0 BY-SA版权

分类专栏：面试题

本文链接：https://blog.youkuaiyun.com/coobj2008/article/details/21555479

面试题专栏收录该内容

144 篇文章

订阅专栏

本文介绍了一种从已排序链表中删除所有重复节点的方法，只保留原始列表中的唯一数字。通过迭代检查相邻节点值来实现这一目标，如果找到重复项，则跳过所有相同值的节点，最终返回处理后的链表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

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 == NULL || head->next == NULL)
            return head;
        ListNode *cur = head;
        while(cur->next != NULL && cur->val == cur->next->val)
            cur = cur->next;
        if(head != cur) {
            while(head != cur->next) {
                ListNode *tmp = head;
                head = head->next;
                delete tmp;
            }
            return deleteDuplicates(head);
        }
        head->next = deleteDuplicates(head->next);
        return head;
    }
};