【LeetCode】 1207. Unique Number of Occurrences 独一无二的出现次数(Easy)(JAVA)
题目地址: https://leetcode.com/problems/unique-number-of-occurrences/
题目描述:
Given an array of integers arr, write a function that returns true if and only if the number of occurrences of each value in the array is unique.
Example 1:
Input: arr = [1,2,2,1,1,3]
Output: true
Explanation: The value 1 has 3 occurrences, 2 has 2 and 3 has 1. No two values have the same number of occurrences.
Example 2:
Input: arr = [1,2]
Output: false
Example 3:
Input: arr = [-3,0,1,-3,1,1,1,-3,10,0]
Output: true
Constraints:
- 1 <= arr.length <= 1000
- -1000 <= arr[i] <= 1000
题目大意
给你一个整数数组 arr,请你帮忙统计数组中每个数的出现次数。
如果每个数的出现次数都是独一无二的,就返回 true;否则返回 false。
解题方法
1、遍历数组,把所有元素的出现的次数存入 HashMap 中
2、遍历 HashMap ,再用一个 Map 记录出现过的次数。如果重复出现,返回 false; 如果没有重复出现,返回 true
class Solution {
public boolean uniqueOccurrences(int[] arr) {
Map<Integer, Integer> map = new HashMap<>();
Map<Integer, Boolean> hasCount = new HashMap<>();
for (int i = 0; i < arr.length; i++) {
Integer temp = map.get(arr[i]);
if (temp == null) {
map.put(arr[i], 1);
} else {
map.put(arr[i], temp + 1);
}
}
for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
Boolean flag = hasCount.get(entry.getValue());
if (flag != null) return false;
hasCount.put(entry.getValue(), true);
}
return true;
}
}
执行耗时:2 ms,击败了91.43% 的Java用户
内存消耗:36.1 MB,击败了97.70% 的Java用户