83. Remove Duplicates from Sorted List

最新推荐文章于 2019-05-12 12:15:31 发布

原创最新推荐文章于 2019-05-12 12:15:31 发布 · 199 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

58 篇文章

订阅专栏

本文介绍了一种算法，用于从已排序的链表中移除重复元素，确保每个元素只出现一次。通过迭代检查相邻节点并调整指针，最终返回更新后的链表头。

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.

和26题很像，只是是链表，要记得更新循环变量，cur

代码如下：

/**
 * 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) {
        if (head == NULL || head->next == NULL) return head;
        ListNode *end = head;
        ListNode *cur = head->next;
        while (cur != NULL) {
            if (end->val != cur->val) {
                end = end->next;
                end->val = cur->val;
            }
            cur = cur->next;
        }
        end->next = NULL;
        return head;
    }
};