题目描述:
在一个排序的链表中,存在重复的结点,请删除该链表中重复的结点,重复的结点不保留,返回链表头指针。 例如,链表1->2->3->3->4->4->5 处理后为 1->2->5
说明:本题目包含复杂数据结构ListNode,点此查看相关信息
/*
struct ListNode {
int val;
struct ListNode *next;
ListNode(int x) :
val(x), next(NULL) {
}
};
*/
class Solution {
public:
ListNode* deleteDuplication(ListNode* pHead)
{
//链表为空的时候
if(pHead == nullptr)
return nullptr;
ListNode* head = new ListNode(-1);
ListNode* now = head;
head->next = pHead;
ListNode* last = pHead;
while(last)
{
if(last->val == last->next->val&&last->next)
{
last = last->next;
while(last->val == last->next->val && last->next != nullptr)
{
last = last->next;
}
last = last->next;
now->next = last;
}
else
{
now = last;
last = last->next;
}
}
return head->next;
}
};