leetcode_91 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.

Return the linked list sorted as well.

Example 1:

Input: 1->2->3->3->4->4->5
Output: 1->2->5

Example 2:

Input: 1->1->1->2->3
Output: 2->3

另外还要注意用例 1 -> 1 -> 1 ,循环退出后，count > 0, 仍然需要处理

有两个节点相同，则count = 1，count指的是与start后面节点值，相同的个数，不包含start本身，前后统一

代码如下：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        ListNode* NewHead = new ListNode(-1,head);
        ListNode* start = NewHead;
        ListNode* end = NewHead->next;
        int count = 0;
        while(end && end->next)
        {
            if(end->val == end->next->val)
            {
                end = end->next;
                count++;
            }
            else
            {
                if(count == 0)
                {
                    start = end;
                    end = end->next;
                }
                else
                {
                    start->next = end->next;
                    end->next = NULL;
                    end = start->next;
                    count = 0;
                }
            }      
        }
        if(count >= 1)    start->next = NULL;
        return NewHead->next;
    }
};