LeetCode之Remove Duplicates from Sorted List II

最新推荐文章于 2023-08-30 08:07:21 发布

原创最新推荐文章于 2023-08-30 08:07:21 发布 · 413 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Leetcode

Leetcode 专栏收录该内容

168 篇文章

订阅专栏

本文介绍了一个用于删除单链表中所有重复元素的算法实现，通过遍历链表并比较节点值来实现去除重复项的目标。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
 /*本题与Remove Duplicates from Sorted List相似，只不过需要删除所有
 重复元素。*/
class Solution {
public:
    ListNode *deleteDuplicates(ListNode *head) {
        if(head == nullptr) return head;
        ListNode newHead(-1);
        newHead.next = head;
        ListNode *pre = &newHead, *cur = head, *next = cur->next;
        if(next == nullptr) return head;
        
        while(next != nullptr){
            if(next->val == cur->val){//删除重复的所有元素
                while(next != nullptr && next->val == cur->val) next = next->next;
                    while(cur != next){
                        ListNode *tmp = cur;
                        pre->next = cur->next;
                        cur = cur->next;
                        delete tmp;
                    }
                    if(cur == nullptr) break;
                    else next = cur->next;
            }
            else{
                pre = pre->next;
                cur = cur->next;
                next = next->next;
            }
        }
        return newHead.next;
    }
};