题解 | #删除有序链表中重复的元素-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
        if (head == nullptr || head->next == nullptr) {
            return head;
        }

        ListNode* comp1 = head;
        ListNode* comp2 = head->next;
        while (comp2 != nullptr) {
            if (comp2->val == comp1->val) {
                comp1->next = comp2->next;
                comp2->next = nullptr;
                delete(comp2);
                comp2 = comp1->next;
            } else {
                comp1 = comp2;
                comp2 = comp1->next;
            }
        }

        return head;
    }
};