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) return head;
        ListNode* pl=head;
        ListNode* pre=NULL;
        
        while(true)
        {
            if(pl==NULL || pl->next==NULL) return head;
            if(pl->next->val==pl->val)
            {
                int val=pl->val;
                while(pl!=NULL && pl->val==val) pl=pl->next;
                if(pre==NULL) head=pl;
                else pre->next=pl;
            }
            else
            {
                pre=pl;
                pl=pl->next;
            }
        }
    }
};