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) {
// if(!head || !head->next) return head;
// ListNode* p = head;
// ListNode* q = head->next;
// while(q){
// if(p->val == q->val){
// ListNode* t = q->next;
// p->next = t;
// delete q;
// }
// else p = p->next;
// q = p ? p->next: NULL;
// }
// return head;
if(!head || !head->next) return head;
head->next = deleteDuplicates(head->next);
return head->val == head->next->val ? head->next : head;
}
};