题解 | #牛群排列去重#

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 null;
        }

        ListNode curr = head;
        ListNode temp = curr.next;

        while(temp != null){
            
            if(curr.val == temp.val){
                curr.next = temp.next;    
                temp = temp.next;
            }
            else{
                curr = temp;
                temp = curr.next;
            }
        }

        return head;
    }
}