leetcode82

/**
 * 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) {
        ListNode* p = head;
        ListNode* r = NULL;
        ListNode* p2 = NULL;
        while(p)
        {
            if(p->next && p->val == p->next->val)
            {
                while(p->next && p->val == p->next->val)
                {
                    p2 = p->next;
                    p = p->next;
                }
                if(r) r->next = p2->next;
                else head = p2->next;
                p = p2->next;
            }
            else
            {
                r = p;
                p = p->next;
            }
            
        }
        return head;
    }
};