标签：leetcode remove duplicates fr
Remove Duplicates from Sorted List
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 *p;
p=head;
while(p!=NULL)
{
if(p->next!=NULL)
{
if(p->val==p->next->val)
p->next=p->next->next;
else
p=p->next;
}
else
return head;
}
return head;
}
};leetcode Remove Duplicates from Sorted List
标签：leetcode remove duplicates fr
原文地址：http://blog.csdn.net/u013011841/article/details/39803915
