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 *pre,*next;
if(head==NULL)
return NULL;
pre=head;
next=pre->next;
while(next)
{
if(pre->val==next->val)
{
pre->next=next->next;
delete(next);
next=pre->next;
}
else
{
pre=next;
next=next->next;
}
}
return head;
}
};