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.

/**
 * 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;
        ListNode *p = head, *q = head->next, *r = NULL; //r is the precursor of p, q is succeed of p
        ListNode *tmp = NULL;
        while(q){
            if(p->val == q->val){
                while(q && q->val == p->val){
                    tmp = q;
                    q = q->next;
                    delete tmp;
                }
                delete p;
                if(r==NULL) head = q;
                else r->next = q;
                p = q;
                if(q) q = q->next;
            }
            else{ r = p; p = q; q = q->next; }
        }
        return head;
    }
};