题目:
代码如下:
struct ListNode {
int val;
ListNode *next;
ListNode(int x) : val(x), next(NULL) {}
};
ListNode *deleteDuplicates(ListNode *head) {
if(head==NULL)return head;
ListNode *head1=head;
while(head1->next!=NULL)
{
if(head1->next->val==head1->val)
{
ListNode *tmp=head1->next;
head1->next=head1->next->next;
delete tmp;
tmp=NULL;
}
else
{
head1=head1->next;
}
}
return head;
}