Leetcode 链表题5

给定一个排序链表，删除所有含有重复数字的节点，只保留原始链表中 没有重复出现 的数字。
示例 1:

输入: 1->2->3->3->4->4->5
输出: 1->2->5
示例 2:

输入: 1->1->1->2->3
输出: 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 || !(head->next))
        {
            return head;
        }
        
        ListNode *pPre;
        ListNode *pCur = head;
        ListNode *pNext = pCur->next;
        
        ListNode* head_result = nullptr;
        ListNode* tail_result = nullptr;
        
        if(pCur->val != pNext->val)
        {
            head_result = pCur;
            tail_result = pCur;
        }
        pPre = pCur;
        pCur = pNext;
        pNext = pNext->next;
        
        while(pNext)
        {
            if((pPre->val != pCur->val) && (pCur->val != pNext->val))
            {
                if(tail_result)
                {
                    tail_result->next = pCur;
                    tail_result = pCur;
                }
                else
                {
                    head_result = pCur;
                    tail_result = pCur;
                }
            }
            
            pPre = pCur;
            pCur = pNext;
            pNext = pNext->next;
        }
        
        if(pPre->val != pCur->val)
        {
            if(tail_result)
            {
                tail_result->next = pCur;
            }
            else
            {
                head_result = pCur;
                
            }
        }
        else
        {
            if(tail_result)
            {
                tail_result->next = nullptr;
            }
        }
        return head_result;
        
    }
};