LEETCODE: Remove Duplicates from Sorted List

停止更新+1

于 2014-12-26 21:49:51 发布

阅读量225

点赞数

CC 4.0 BY-SA版权

文章标签： LEETCODE 算法 LinkList

本文链接：https://blog.youkuaiyun.com/anyicheng2015/article/details/42177767

LEETCODE 专栏收录该内容

153 篇文章

订阅专栏

本文提供了一种从已排序链表中删除所有重复元素的方法，确保每个元素仅出现一次。通过遍历链表并比较相邻节点值来实现这一目标。

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

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.

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

            cur = cur->next;
        }
        return head;
    }
};