首页 > 代码库 > Remove Duplicates from Sorted List II
Remove Duplicates from Sorted List II
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
.
/**
* 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)
{
if(head==NULL) return head;
ListNode* pl=head;
ListNode* pre=NULL;
while(true)
{
if(pl==NULL || pl->next==NULL) return head;
if(pl->next->val==pl->val)
{
int val=pl->val;
while(pl!=NULL && pl->val==val) pl=pl->next;
if(pre==NULL) head=pl;
else pre->next=pl;
}
else
{
pre=pl;
pl=pl->next;
}
}
}
};
* 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)
{
if(head==NULL) return head;
ListNode* pl=head;
ListNode* pre=NULL;
while(true)
{
if(pl==NULL || pl->next==NULL) return head;
if(pl->next->val==pl->val)
{
int val=pl->val;
while(pl!=NULL && pl->val==val) pl=pl->next;
if(pre==NULL) head=pl;
else pre->next=pl;
}
else
{
pre=pl;
pl=pl->next;
}
}
}
};
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。