1
0
Fork 0
mirror of https://gitlab.com/mfocko/LeetCode.git synced 2024-09-19 01:36:57 +02:00

rs: add «3005. Count Elements With Maximum Frequency»

Signed-off-by: Matej Focko <mfocko@redhat.com>
This commit is contained in:
Matej Focko 2024-03-08 19:59:26 +01:00
parent f65d94b769
commit fe9f5ac9da
Signed by: mfocko
GPG key ID: 7C47D46246790496

View file

@ -0,0 +1,13 @@
use std::collections::HashMap;
impl Solution {
pub fn max_frequency_elements(nums: Vec<i32>) -> i32 {
let mut freqs: HashMap<i32, usize> = HashMap::new();
for &x in &nums {
*freqs.entry(x).or_insert(0) += 1;
}
let m = *freqs.values().max().unwrap();
(m * freqs.iter().filter(|&(_, f)| *f == m).count()) as i32
}
}