【链表】leetcode_83_删除排序链表中的重复元素
c++
/**
* 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 = new ListNode(10000);
dummyHead->next = head;
ListNode *cur = dummyHead;
while(cur && cur->next){
if (cur->val == cur->next->val){
ListNode *tmp = cur->next;
cur->next = cur->next->next;
delete tmp;
}else{
cur = cur->next;
}
}
ListNode *re = dummyHead->next;
delete dummyHead;
return re;
}
};