小明的筷子java

代码如下：

有待改进 请指教

    import java.util.HashMap;
    import java.util.Map;
    import java.util.Scanner;
    public class test {
        public static void main(String[] args){
            Scanner s = new Scanner(System.in);
            int num = s.nextInt();
            int[] input = new int[num];
            for(int i = 0; i < num; i++){
                input[i] = s.nextInt();
            }
            int n = check(input);
            System.out.println(n);
            s.close();
        }
        public static int check(int[] chop){
            Map<Integer, Integer> kz = new HashMap<Integer, Integer>();
            int count = 0;

            for(int i = 0; i < chop.length; i++){
                if(kz.containsKey(chop[i])){
                    count = kz.get(chop[i]) + 1;
                }else {
                    count = 1;
                }
                kz.put(chop[i], count);
            }

            for(int i = 0; i < chop.length; i++){
                if(kz.get(chop[i]) % 2 == 0){
                    continue;
                }
                else if(kz.get(chop[i]) % 2 != 0){
                    return chop[i];
                }
            }

            return -1;
        }
    }