(力扣)面试题56 - I. 数组中数字出现的次数

class Solution {
    public int[] singleNumbers(int[] nums) {
        Map<Integer,Integer> maps = new HashMap<>();
        for (int k:nums) {
            maps.put(k,maps.containsKey(k)?maps.get(k)+1:1);
        }

        int [] in = new int[2];
        int i = 0;
        for (Integer key:maps.keySet()) {
            if(maps.get(key)==1){
                in[i] = key;
                i++;
            }
        }
        return in;
    }
}