题解 | #升序链表的删除#
升序链表的删除
https://www.nowcoder.com/practice/22243a45ec9b425ea608d5fe3f6bb1f6
/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : val(x), next(nullptr) {} * }; */ #include <cmath> class Solution { public: /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param head ListNode类 * @return ListNode类 */ ListNode* deleteDuplicates(ListNode* head) { // write code here if(!head) return head; ListNode* start = head; ListNode* explor = head->next; while(explor){ if(explor->val != head->val){ head = head->next; if(head != explor) head->val = explor->val; } explor = explor->next; } // 删除后面的链表 head->next = nullptr; return start; } };