[leetcode]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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(!head) return NULL;
        ListNode *dummy = new ListNode(head->val-1);
        dummy -> next = head;
        int cur = dummy->val;
        ListNode *p = dummy, *q, *r;
        
        while(p->next && p->next->next){
            q = p->next;
            r = q->next;
            
            if(q->val == r->val){
                cur = q->val;
                p->next = r->next;
                delete q;
                delete r;
                
            }else if(q->val == cur){
                p->next = r;
                delete q;
            }else{
                p = p->next;
            }
            
        }
        
        if(p->next && p->next->val == cur){
            p->next = p->next->next;
            delete p->next;
        }
        
        return dummy->next;
        
    }
};