题目:
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
For example,
Given 1->2->3->3->4->4->5
, return 1->2->5
.
Given 1->1->1->2->3
, return 2->3
.
思路:
和普通的删除重复元素的题目不同,本题目中一旦发现有重复元素,还需要把该元素第一次出现的位置也删掉。因此,我们每次需要首先判断是否出现了重复元素,然后再开始删除重复元素。同样地,给链表添加一个虚拟头结点有利于简化处理流程。本题目的时间复杂度是O(n),空间复杂度是O(1)。
代码:
/**
* 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) {
ListNode preHead(-1);
preHead.next = head;
ListNode *node = head;
ListNode *preNode = &preHead;
while (node != NULL && node->next != NULL) {
if (node->val == node->next->val) {
int value = node->val;
while (node != NULL && node->val == value) {
preNode->next = node->next;
delete node;
node = node->next;
}
}
else {
preNode = node;
node = node->next;
}
}
return preHead.next;
}
};