题解 | #删除有序链表中重复的元素-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* dummy = new ListNode(0);
        dummy->next=head;
        ListNode* cur = dummy;

        while(cur->next!=nullptr)
        {
            ListNode* nex = cur->next;
            while(nex->next!=nullptr&&nex->val==nex->next->val)
                nex=nex->next;
            if(cur->next!=nex)
            {
                cur->next=nex;
            }else
            {
                cur=cur->next;
            }

        }
        return dummy->next;
    }
};