[leetcode] Remove Duplicates from Sorted List

最新推荐文章于 2022-04-03 23:05:05 发布

原创最新推荐文章于 2022-04-03 23:05:05 发布 · 297 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

222 篇文章

订阅专栏

本博客介绍如何使用迭代法解决删除排序链表中重复元素的问题，通过遍历链表，只保留每个唯一值的第一个节点。

From : https://leetcode.com/problems/remove-duplicates-from-sorted-list/

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) return NULL;
        ListNode* p1 = head, *p2 = head->next, *t;
        while(p2) {
            if(p1->val == p2->val) {
                t = p2;
                p2 = p2->next;
                p1->next = p2;
                delete t;
            } else {
                p1 = p2;
                p2 = p2->next;
            }
        }
        return head;
    }
};