为了加深印象,所以在这里写下代码。对指针和链表很不熟悉。。
/**
* 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 *cur=head,*del=NULL;
if(head==NULL)
return NULL;
while(cur->next!=NULL)
{
if(cur->val==cur->next->val)
{
del = cur->next;
cur->next = del->next;
delete del;
}
else{
cur = cur->next;
}
}
return head;
}
};