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

class Solution {
public:
    /**
     * 
     * @param head ListNode类 
     * @return ListNode类
     */
    ListNode* deleteDuplicates(ListNode* head) {
        if(head==NULL||head->next==NULL)
            return head;
        ListNode*returnhead=head;
        ListNode*cur=head;
        ListNode*next=head->next;
        while(next)
        {
        if(next&&next->val==cur->val){
            
            while(next&&next->val==cur->val)
                {
                    next=next->next;
                }
            cur->next=next;
            cur=next;
        }
        else if(next&&next->val!=cur->val){
            cur=next;
        }
            if(next)
            next=next->next;
        }
        return returnhead;