Leetcode 83. Remove Duplicates from Sorted List

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

scuter_victor

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

阅读量443

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/SCTU_vroy/article/details/52810577

版权

LeetCode 专栏收录该内容

19 篇文章

订阅专栏

本文提供了一种使用Java、C++及C语言实现的方法，该方法可以遍历一个已排序的链表并移除所有重复的节点，确保每个元素只出现一次。通过几个关键步骤，实现了高效地删除重复项。

摘要生成于 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.

Java代码：

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode deleteDuplicates(ListNode head) {
        if(head == null) return null;
        ListNode nodePre = head;
        ListNode nodeNext = head.next;
        int val = head.val;
        while(nodeNext != null) {
            if(nodeNext.val == val) {
                nodePre.next = nodeNext.next;
            }
            else {
                val = nodeNext.val;
                nodePre = nodeNext;
            }
            nodeNext = nodeNext.next;
        }
        return head;
    }
}

C++代码：

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

C代码：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* deleteDuplicates(struct ListNode* head) {
    if(head == NULL) return NULL;
    int val = head->val;
    struct ListNode* nodePre = head;
    struct ListNode* nodeNext = head->next;
    while(nodeNext != NULL) {
        if(nodeNext->val == val) {
            nodePre->next = nodeNext->next;
        }
        else {
            val = nodeNext->val;
            nodePre = nodeNext;
        }
        nodeNext = nodeNext->next;
    }
    return head;
}