【LeetCode】Remove Duplicates from Sorted List II

最新推荐文章于 2024-01-17 14:07:10 发布

原创最新推荐文章于 2024-01-17 14:07:10 发布 · 279 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #链表

leetcode 专栏收录该内容

98 篇文章

订阅专栏

本文介绍了一种删除单链表中重复节点的高效算法，通过使用虚拟头结点和双指针技巧，确保了算法的时间复杂度为O(n)，其中n为链表长度。

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

/**
 * 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 *pre, *cur;
	if (head == NULL)
		return head;
	ListNode *fakehead = new ListNode(0);
	fakehead->next = head;
	pre = fakehead;
	cur = head;
	while (cur)
	{
		bool duplicated = false;
		while(cur->next && cur->val == cur->next->val)
		{
			duplicated = true;
			ListNode *tmp = cur;
			cur = cur->next;
			delete tmp;
		}
		if (duplicated)
		{
			ListNode *tmp = cur;
			cur = cur->next;
			delete tmp;
			continue;
		}
		pre->next = cur;
		pre = pre->next;
		cur = cur->next;
	}
	pre->next = cur;
	return fakehead->next;
    }
};