删除单向链表中重复的节点

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)
        {
            return NULL;
        }

        ListNode *first = head;
        int firstVal = head->val;
        while (first != NULL && first->next != NULL && first->next->val == firstVal)
        {
            bool dupFound = false;
            while (first->next != NULL && first->next->val == firstVal)
            {
                ListNode *temp = first->next;
                delete first;
                first = temp;
                dupFound = true;
            }
            if (dupFound)
            {
                ListNode *temp = first->next;
                delete first;
                first = temp;
            }
            if (first != NULL)
            {
                firstVal = first->val;
            }
        }

        if (first == NULL || first->next == NULL)
        {
            return first;
        }
        ListNode *p = first;
        ListNode *q = p->next;
        ListNode *r = q->next; 
        while (q != NULL && r != NULL)
        {
            bool dupFound = false;
            while (r != NULL && r->val == q->val)
            {
                ListNode *temp = r->next;
                delete r;
                dupFound = true;
                r = temp;
                q->next = r;
            }
            if (dupFound)
            {
                ListNode *temp = q->next;
                delete q;
                q = temp;
                p->next = q;
            }
            else
            {
                p = q;
                q = q->next;
            }

            if (q != NULL)
            {
                r = q->next;
            }
        }

        return first;
    }
};