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

/**

• struct ListNode {
• int val;
• struct ListNode *next;
• }; */

class Solution { public: /** * * @param head ListNode类 * @return ListNode类 / ListNode deleteDuplicates(ListNode* head) { // write code here ListNode* Q= head; while(Q && Q->next) { if(Q->val == Q->next->val) { Q->next = Q->next->next; }else{ Q = Q->next; }

    }
    
    return head;
}

};