题解 | #数组中只出现一次的两个数字#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     *
     * @param array int整型一维数组
     * @return int整型一维数组
     */
    public int[] FindNumsAppearOnce (int[] array) {
        Map<Integer, Integer> map = new HashMap<>(16);
        int[] retArray = new int[2];
        for (int i = 0; i < array.length; i++) {
            if (map.get(array[i]) == null) {
                System.out.println("A");
                map.put(array[i], 1);
            } else {
                System.out.println("B");
                map.put(array[i], map.get(array[i]) + 1);
            }
            System.out.println(i+"--"+map.get(array[i]));
        }
        int i = 0;
        Iterator<Map.Entry<Integer, Integer>> iterator = map.entrySet().iterator();
        while (iterator.hasNext()) {
            Map.Entry<Integer, Integer> next = iterator.next();
            Integer key = next.getKey();
            Integer value = next.getValue();
            System.out.println(key+"=="+value);
            if (key != null && value == 1) {
                retArray[i++] = key;
            }

        }
        return retArray;
        // write code here
    }
}