82. Remove Duplicates from Sorted List II leetcode list--插入头节点的重要性

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.

ListNode* deleteDuplicates(ListNode* head) {
        if(NULL == head || NULL == head->next)
        {
            return head;
        }

        //插入头节点的技巧
        ListNode* newList = new ListNode(-1);
        newList->next = head; 
        head = newList;

        while(head->next && head->next->next)
        {
            if(head->next->val == head->next->next->val)
            {
                int val = head->next->val;
                while(head->next && head->next->val == val)
                {
                    head->next = head->next->next;
                } 
            }
            else
            {
                head = head->next;
            } 
        }
        //
        return newList->next;
    }

参考：http://www.jiuzhang.com/solutions/remove-duplicates-from-sorted-list-ii/