g1201_1300.s1207_unique_number_of_occurrences.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
package g1201_1300.s1207_unique_number_of_occurrences;
// #Easy #Array #Hash_Table #2022_04_29_Time_2_ms_(82.71%)_Space_42.4_MB_(34.08%)
import java.util.HashMap;
import java.util.Map;
public class Solution {
public boolean uniqueOccurrences(int[] arr) {
Map map = new HashMap<>();
for (int j : arr) {
if (map.containsKey(j)) {
map.put(j, map.get(j) + 1);
} else {
map.put(j, 1);
}
}
// map for check unique number of count
Map uni = new HashMap<>();
for (Integer val : map.values()) {
if (uni.containsKey(val)) {
return false;
} else {
uni.put(val, 1);
}
}
return true;
}
}