题解 | #牛群排列去重#

/**
 * struct ListNode {
 *  int val;
 *  struct ListNode *next;
 * };
 */
/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param head ListNode类
 * @return ListNode类
 */
struct ListNode* deleteDuplicates(struct ListNode* head ) {
    // write code here
    if (!head || !head->next)
        return head;
    struct ListNode* tmp = (struct ListNode*)malloc(sizeof(struct ListNode));
    tmp->next=head;
    struct ListNode* s1 = tmp;
    struct ListNode* s2 = tmp;
    while (s2 != NULL) {
        if (s2->next != NULL && s2->val == s2->next->val) {
            s2 = s2->next;
            continue;
        }
        s2 = s2->next;
        /*if (s2 != NULL && s2->next != NULL && s2->val == s2->next->val) {
            s2 = s2->next;
            continue;
        }*/
        s1->next = s2;
        s1 = s1->next;
    }
    return tmp->next;
}