1207. 独一无二的出现次数

1207. 独一无二的出现次数

代码：

class Solution {
    public boolean uniqueOccurrences(int[] arr) {
        HashMap<Integer, Integer> counter = new HashMap<>();
        for (int i = 0; i < arr.length; i++)
        {
            if (!counter.containsKey(arr[i])) counter.put(arr[i], 1);
            else counter.put(arr[i], counter.get(arr[i]) + 1);
        }
        int[] count = new int[arr.length];
        for (Map.Entry<Integer, Integer> node: counter.entrySet()) count[node.getValue()]++;
        for (int i = 0; i < count.length; i++)
        {
            if (count[i] != 0) {
                if (count[i] > 1) return false;
            }
        }
        return true;
    }
}