Remove Duplicates from Sorted List 分类： ...-CSDN博客

本文介绍了一种算法，用于删除已排序链表中的所有重复元素，确保每个元素只出现一次。通过三种不同的实现方式，包括迭代和递归方法，展示了如何高效地解决这一问题。

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

Remove Duplicates from Sorted List

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) {
        ListNode *p;
        if(!head || !head->next) return head;
        p=head;
        while(p->next)
        {
            if(p->val==p->next->val)
            {
                p->next=p->next->next;
            }
            else
            {
                p=p->next;        
            }
        }
        return head;
    }
};

class Solution {
public:
    ListNode *deleteDuplicates(ListNode *head) {
        if(head == NULL) return NULL;
        for (ListNode *prev = head, *cur = head->next; cur; cur = cur->next) {
            if(prev ->val == cur->val) {
                prev->next = cur->next;
                delete cur;
            } else {
                prev = cur;
            }
        }
        return head;
    }
};

class Solution {
public:
    ListNode *deleteDuplicates(ListNode *head) {
        if (!head) return head;
        ListNode dummy(head->val +1);
        dummy.next = head;
        
        recur(&dummy, head);
        return dummy.next;
    }
private:
    static void recur(ListNode *prev, ListNode *cur){
        if (cur == NULL) return ;
        
        if (prev->val == cur->val) {
            prev ->next = cur->next;
            delete cur;
            return(prev, prev->next);
        } else {
            retcur( prev->next, cur->next);
        }
    }
};

转载于:https://www.cnblogs.com/learnordie/p/4656951.html