82. 删除排序链表中的重复元素 II

82. 删除排序链表中的重复元素 II

内存泄漏到爆炸了

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        ListNode dummyHead;
        dummyHead.next = head;
        ListNode* pre = &dummyHead;
        ListNode* point = head;
        while(point)
        {
            if(!(point->next && point->next->val == point->val))
            {
                if(!(pre->next == point))
                    pre->next = point->next;
                else
                    pre = point;
            }
            point = point->next;
        }
        return dummyHead.next;
    }
};