leetcode Remove Duplicates from Sorted List II

我的做法比较差吧，用了4个指针，分了好几个情况，还是太菜了。具体做法就是先存储当前结点的值和后面的进行比较，直到next到不同的值，再对current的val值更新成next的val值，有几个特殊的点想了比较久，就变成下面判断比较复杂的情况。。。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */
struct ListNode* deleteDuplicates(struct ListNode* head) {
    if(!head || !head->next)
        return head;
    struct ListNode *current = head,*next,*pre,*begin = NULL;
    int temp;
    while(current ){
        temp = current->val;
        next = current->next;
        if(next && temp == next->val){
            while(next && temp == next->val){
                pre = next;
                next = next->next;
            }
            if(next){
                current->val = next->val;
                current->next = next->next;
            }else{
                current = NULL;
                if(!begin)
                    return NULL;
                begin->next = current;
            }
        }
        else{
            begin = current;
            current = current->next;
        }
    }
    return head;
}