leetcode 83和84 Remove Duplicates from Sorted List 和leetcode 1836

目录

[83. Remove Duplicates from Sorted List](#83. Remove Duplicates from Sorted List)

[82. Remove Duplicates from Sorted List II](#82. Remove Duplicates from Sorted List II)

[1836. Remove Duplicates From an Unsorted Linked List](#1836. Remove Duplicates From an Unsorted Linked List)


删除链表中的结点合集

83. Remove Duplicates from Sorted List

代码:

cpp 复制代码
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        if(head == nullptr)
            return head;
        ListNode* pre = head;
        ListNode* cur = head->next;
        ListNode* nex = nullptr;
        while(cur){
            nex = cur->next;
            if(cur->val == pre->val){
                pre->next = nex;
                delete cur;
                cur = nex;
            }else{
                pre = cur;
                cur = nex;
            }
        }
        return head;
    }
};

82. Remove Duplicates from Sorted List II

代码:

cpp 复制代码
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        if(head == nullptr)
            return head;
        ListNode* dummy = new ListNode(-1,head);
        ListNode* prepre = dummy;
        int pre_val = head->val;
        ListNode* pre = head;
        ListNode* cur = pre->next;
        ListNode* nex = nullptr;
        while(cur){
            nex = cur->next;
            if(cur->val == pre_val){
                prepre->next = nex;
                if(pre){
                    delete pre;
                    pre = nullptr;
                }
                delete cur;
                cur = nex;
            }else{
                if(pre){
                    prepre = pre;
                }
                pre = cur;
                pre_val = pre->val;
                cur = nex;
            }
        }
        ListNode* ans = dummy->next;
        delete dummy;
        return ans;
    }
};

1836. Remove Duplicates From an Unsorted Linked List

代码:

cpp 复制代码
/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* deleteDuplicatesUnsorted(ListNode* head) {
        unordered_map<int,int> count;
        ListNode* cur = head;
        while(cur){
            count[cur->val]++;
            cur = cur->next;
        }
        ListNode* dummy = new ListNode(-1,head);
        ListNode* pre = dummy;
        cur = head;
        ListNode* post = nullptr;
        while(cur){
            post = cur->next;
            if(count[cur->val] > 1){
                pre->next = post;
                // delete cur;
                cur = post;
            }else{
                pre = cur;
                cur = post;
            }
        }

        ListNode* ans = dummy->next;
        delete dummy;
        return ans;
    }
};
相关推荐
m0_640743563 小时前
华为OD-2024年E卷-字符串分割[100分] -- python
数据结构·算法·华为od
圣保罗的大教堂7 小时前
leetcode 2566. 替换一个数字后的最大差值 简单
leetcode
剪一朵云爱着7 小时前
力扣面试题 17.05. 字母与数字
算法·leetcode
code喵喵8 小时前
八种数据结构简介
数据结构·算法·推荐算法
wen__xvn9 小时前
九日集训第三天
数据结构·算法·leetcode
dying_man9 小时前
LeetCode--33.搜索旋转排序数组
算法·leetcode
东方芷兰9 小时前
Leetcode 刷题记录 17 —— 堆
java·c++·b树·算法·leetcode·职场和发展
蒙奇D索大10 小时前
【数据结构】图论实战:DAG空间压缩术——42%存储优化实战解析
数据结构·笔记·学习·考研·图论·改行学it
wen__xvn11 小时前
九日集训第六天
数据结构·算法·leetcode
贰拾wan15 小时前
ArrayList源码分析
java·数据结构