问题
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.
解答
链表的运用!
Easy!
/**
* 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=head;
if(p==NULL) return NULL;
while(p->next)
{
if(p->val!=p->next->val)
p=p->next;
else
p->next=p->next->next;
}
return head;
}
};