LeetCode No.82 Remove Duplicates from Sorted List II

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

For example,
Given 1->2->3->3->4->4->5, return 1->2->5.

Given 1->1->1->2->3, return 2->3.

=======================================================

题目链接：https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/

题目大意：除去排序链表中所有重复的数值。

思路：递归，每次去除当前节点开始的重复数值。

参考代码：

/**
 * 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 == NULL || head -> next == NULL )
            return head ;
        if ( head -> val != head -> next -> val )
        {
            head -> next = deleteDuplicates ( head -> next ) ;
            return head ;
        }
        ListNode* cur = head ;
        int v = cur -> val ;
        while ( cur != NULL && cur -> val == v )
        {
            cur = cur -> next ;
        }
        return deleteDuplicates ( cur ) ;
    }
};