本文介绍了一种算法，该算法可以有效地移除已排序链表中的所有重复元素，确保每个元素仅出现一次。通过迭代遍历链表并比较相邻节点的值来实现重复项的删除。
Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->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) {
ListNode *tmp=head,*p;
if(head==NULL)
return head;
while(tmp)
{
p=tmp->next;
while(p)
{
if(tmp->val==p->val)
tmp->next=p->next;//delete a duplicate
else
break;
p=p->next;
}
tmp=p;//注意循环的末尾和初始条件
}
return head;
}
};
Given a sorted linked list, delete all duplicates such that each element appear only once.
For example,
Given 1->1->2, return 1->2.
Given 1->1->2->3->3, return 1->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) {
ListNode *tmp=head,*p;
if(head==NULL)
return head;
while(tmp)
{
p=tmp->next;
while(p)
{
if(tmp->val==p->val)
tmp->next=p->next;//delete a duplicate
else
break;
p=p->next;
}
tmp=p;//注意循环的末尾和初始条件
}
return head;
}
};
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
