LeetCode 83. 删除排序链表中的重复元素

给定一个排序链表，删除所有重复的元素，使得每个元素只出现一次。

示例 1:

输入: 1->1->2
输出: 1->2
示例 2:

输入: 1->1->2->3->3
输出: 1->2->3

我给的解法是：

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */

static const auto _____ = []()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    return nullptr;
}();
class Solution {
public:
    ListNode* deleteDuplicates(ListNode* head) {
        if (head == NULL)
			return NULL;
		ListNode* next = head->next;
		if (next != NULL && next->next == NULL)
		{
			if (next->val == head->val)
			{
				next = NULL;
				head->next = NULL;
			}
		}
		if (next != NULL)
		{
			if (next->val == head->val)
			{
				// 找到下一个不重复的节点
				int val = head->val;
				bool flag = true;
				while (next->next != NULL)
				{
					next = next->next;
					if (next->val != head->val)
					{
						head->next = next;
						head = this->deleteDuplicates(head);
						flag = false;
						break;
					}
				}
				if (flag)
				{
					head->next = NULL;
				}
			}
			else
			{
				head->next = this->deleteDuplicates(next);
			}
		}
		return head;
    }
};