题目链接:https://leetcode-cn.com/problems/remove-duplicates-from-sorted-list-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* dummy=new ListNode(-1,head);
ListNode* pre=dummy;
while(pre->next!=NULL&&pre->next->next!=NULL){
if(pre->next->val==pre->next->next->val){
//如果当前pre->next和pre->next->next对应的元素相同,需要将pre->next以及所有后面拥有相同元素值的链表节点全部删除
//方法:记下这个元素值,随后不断将pre->next从链表中移除,直到pre->next为空节点或者其元素值不等于x为止
int temp=pre->next->val;
while(pre->next&&pre->next->val==temp){
pre->next=pre->next->next;
}
}else {
pre=pre->next;
}
}
return dummy->next;
}
};