题目描述
在一个排序的链表中,存在重复的结点,请删除该链表中重复的结点,重复的结点不保留,返回链表头指针。 例如,链表1->2->3->3->4->4->5 处理后为 1->2->5
输入:
{1,2,3,3,4,4,5}
输出:
{1,2,5}
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};
*/
class Solution {
public:
ListNode* deleteDuplication(ListNode* pHead) {
if (pHead == nullptr || pHead->next == nullptr) {
return pHead;
}
ListNode* dummy = new ListNode(-1);
dummy->next = pHead;
ListNode* pre = dummy;
ListNode* cur = nullptr;
ListNode* temp = nullptr;
while (pre->next != nullptr) {
cur = pre->next;
if (cur->next != nullptr && cur->next->val == cur->val) {
int target = cur->val;
while (cur != nullptr && cur->val == target) {
temp = cur;
cur = cur->next;
delete temp;
}
pre->next = cur;
} else {
pre = pre->next;
}
}
return dummy->next;
}
};