/**
* 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) return head;
ListNode *prev = head;
ListNode *cur = head->next;
while (cur) {
if (cur->val == prev->val) {
prev->next = cur->next;
cur = cur->next;
} else {
prev = cur;
cur = cur->next;
}
}
return head;
}
};
思路
使用两个指针,依次比较元素;