楼主:
yam276 ('_')
2024-03-08 18:25:35※ 引述《sustainer123 (caster )》之铭言：
: 3005. Count Elements With Maximum Frequency
: 计算出现最多次的元素之次数之总和
: 思路:
: 用哈希表计算次数 最后比大小加总
开始习惯用Rust的小鸡巴东西跟缝合怪了==
Code:
use std::collections::HashMap;
impl Solution {
pub fn max_frequency_elements(nums: Vec<i32>) -> i32 {
let mut counts = HashMap::new();
for num in nums {
*counts.entry(num).or_insert(0) += 1;
}
let max_frequency = counts.values().max().unwrap();
counts.iter().filter(|(_, &v)| v == *max_frequency)
.map(|(_, &v)| v).sum()
}
}