https://leetcode.com/problems/unique-number-of-occurrences/
1207. Unique Number of Occurrences
给一个阵列，判断每种数字的出现次数是否为唯一
思路：
1. 先用HashMap蒐集出现次数
2. 尝试用出现次数插入一个HashSet，失败代表非唯一
Code:
use std::collections::{HashMap, HashSet};
impl Solution {
pub fn unique_occurrences(arr: Vec<i32>) -> bool {
let mut hash_arr: HashMap<i32, i32> = HashMap::new();
for num in arr{
*hash_arr.entry(num).or_insert(0) += 1;
}
let mut occurrences = HashSet::new();
for count in hash_arr.values() {
if !occurrences.insert(count) {
return false;
}
}
true
}
}

大师

大师