题解 | #牛群排列去重#
牛群排列去重
https://www.nowcoder.com/practice/8cabda340ac6461984ef9a1ad66915e4
/** * struct ListNode { * int val; * struct ListNode *next; * }; */ /** * 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可 * * * @param head ListNode类 * @return ListNode类 */ struct ListNode* deleteDuplicates(struct ListNode* head ) { // write code here struct ListNode*pre,*q; if(head==NULL||head->next==NULL) return head; pre = head; q = pre->next; while (q) { if(pre->val==q->val) { pre->next = q->next; q = q->next; } else { pre = q; q = q->next; } } return head; }