我的思路
当前位置和之前位置,temp变量用于记录重复结点,用于删除。
一开始多用了个old变量,后来发现pre->val就行了。
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* deleteDuplicates(ListNode* head) {
//ordered
if(head == NULL) return head;
ListNode *curr = head->next, *pre = head, *temp;
while(curr){
if(pre->val == curr->val){
temp = curr;
pre->next = curr->next;
delete(temp);
curr = pre->next;
}else{
curr = curr->next;
pre = pre->next;
}
}
return head;
}
};