题解 | #牛群排列去重#

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 *   public ListNode(int val) {
 *     this.val = val;
 *   }
 * }
 */

public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param head ListNode类
     * @return ListNode类
     */
    public ListNode deleteDuplicates (ListNode head) {
        // write code here
        if(head==null){
            return head;
        }
        ListNode tempNode = head;
        ListNode temp2;
        int falgDuplicate = 0;
        while (tempNode.next != null) {
            temp2 = tempNode;
            while (tempNode.val == tempNode.next.val) {
                falgDuplicate = 1;
                tempNode = tempNode.next;
                if (tempNode.next == null) {
                    temp2.next = null;
                    break;
                }
            }
            if (falgDuplicate == 1) {
                temp2.next = tempNode.next;
            }
            tempNode = tempNode.next;
            if (tempNode == null) {
                break;
            }
        }
        return head;
    }
}