//
// Created by 罗炳国 on 2023/7/21.
//

#ifndef PFJ_CODE10_DELETEDUPLICATES_H
#define PFJ_CODE10_DELETEDUPLICATES_H

#include "commonHeader.h"
/**
 * 给定一个已排序的链表的头 head ， 删除所有重复的元素，使每个元素只出现一次 。返回 已排序的链表 。
 * https://leetcode.cn/problems/remove-duplicates-from-sorted-list/
 * */

class code10_deleteDuplicates {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        if (head == nullptr) return nullptr;
        ListNode *cur = head->next, *pre = head;

        while (cur != nullptr) {
            if (cur->val == pre->val) {
                pre->next = cur->next;
                delete(cur);
                cur = pre->next;
            } else {
                pre = cur;
                cur = cur->next;
            }

        }
        return head;
    }
};

#endif //PFJ_CODE10_DELETEDUPLICATES_H