Leedcode:remove duplicates from sorted list 2

给定一个有序的单链表，删除所有重复的节点，只剩下不重复的节点；

例如1->2->2->3->4->5

返回1->3->4->5

递归实现：

/**

* 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->next;

if(head->val == p->val){

while(p && head->val == p->val){

ListNode *tmp = p;

p = p->next;

delete tmp;

}

delete head;

return deleteDuplicates(p);

}else{

head->next = deleteDuplicates(head->next);

return head;

}

}

};