题解 | #删除有序链表中重复的元素-I#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 *	ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param head ListNode类 
     * @return ListNode类
     */
    ListNode* deleteDuplicates(ListNode* head) {
        // write code here
        ListNode* new_head = new ListNode(101);
        new_head->next = head;
        ListNode* pre = new_head;
        ListNode* cur = head;
        while (cur) {
            ListNode* internal_cur = cur;
            while (internal_cur && internal_cur->val == pre->val) {
                internal_cur = internal_cur->next;
            }
            if (!internal_cur) {
                pre->next = internal_cur;
                return new_head->next;
            }
        
            pre->next = internal_cur;
            cur = internal_cur->next;
            pre = internal_cur;
        }

        return new_head->next;
    }
};