Remove Duplicates from Sorted List（链表元素去重）

最新推荐文章于 2024-01-14 06:20:00 发布

原创最新推荐文章于 2024-01-14 06:20:00 发布 · 411 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #algorithm #链表去重复元素

LeetCode OJ 专栏收录该内容

71 篇文章

订阅专栏

本文介绍了一种算法，用于从已排序的链表中移除所有重复元素，确保每个元素只出现一次。提供了完整的C++代码实现，并通过实例演示了如何从链表中去除重复项。

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.

题目本身很简单但是要注意判断空链表情况。。提交了3次才ac

/**
 * 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) {
        // Note: The Solution object is instantiated only once and is reused by each test case.
        if (head == NULL) return NULL;
        ListNode* curPtr = head, *comparePtr = head->next;
		while (comparePtr)
		{
			if (comparePtr->val == curPtr->val)
			{
				curPtr->next = comparePtr->next;
			}
			else
				curPtr = comparePtr;
			comparePtr = comparePtr->next;
		}
		return head;
    }
};