class Solution {
public:
ListNode* deleteDuplication(ListNode* pHead)
{
ListNode* first = new ListNode(-1);
first->next = pHead;
ListNode* slow = first;
ListNode* fast = pHead;
while(fast!=nullptr&&fast->next!=nullptr)
{
if(fast->val == fast->next->val)
{
int val = fast->val;
while(fast!=nullptr&&fast->val == val)
{
fast = fast->next;
}
slow->next = fast;
}
else
{
slow = fast;
fast = fast->next;
}
}
return first->next;
}
};
删除链表中重复的结点
最新推荐文章于 2023-04-13 17:17:20 发布