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) {
// 如果原链表为空或者只有一个元素,就直接返回原链表
if(head == nullptr || head->next == nullptr) return head;
// 创建虚拟头节点
ListNode* dummy = new ListNode(-1);
dummy->next = head;
ListNode* front = dummy, *cur = head;
while(cur){
// 跳过当前的重复节点,使得cur指向当前重复元素的最后一个位置
while(cur->next && cur->val == cur->next->val){
cur = cur->next;
}
// 如果front和cur之间没有重复的元素,front后移
if(front->next == cur){
front = front->next;
}else{ // front和cur之间有重复的元素,就跳过重复的元素,即front->next = cur->next;
front->next = cur->next;
}
// 不管有没有重复的元素,每次cur都要后移
cur = cur->next;
}
return dummy->next;
}
};
/**
* 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) {
if(!head || !head->next) return head;
ListNode* dummy = new ListNode(-1);
dummy->next = head;
ListNode* front = dummy, *cur = head;
while(cur){
ListNode *curNext = cur->next;
while(curNext && cur->val == curNext->val){
curNext = curNext->next;
}
// curNext 移动过,说明中间存在重复元素,将 front 的 next 指针指向当前的 curNext,这样就跳过了重复元素
if(curNext != cur->next){
front->next = curNext;
cur = curNext;
}
//curNext 没有移动过,front 和 cur 向后移动一位
else{
front = cur;
cur = curNext;
}
}
return dummy->next;
}
};