Leetcode137: 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) {        ListNode *pre,*cur;        ListNode* temp = new ListNode(-1);        temp->next = head;        pre = temp;        cur = head;        while(cur && cur->next)        {            if(cur->val == cur->next->val)            {                while(cur->next && cur->val == cur->next->val)                {                    cur = cur->next;                }                pre->next = cur->next;                cur = cur->next;            }            else            {            pre = cur;            cur = cur->next;            }        }        return temp->next;    }};