/
greedy.rs
52 lines (41 loc) · 1.36 KB
/
greedy.rs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
pub struct Solution;
// ------------------------------------------------------ snip ------------------------------------------------------ //
use std::cmp::Reverse;
use std::collections::binary_heap::PeekMut;
use std::collections::{BinaryHeap, HashMap};
impl Solution {
pub fn find_least_num_of_unique_ints(arr: Vec<i32>, k: i32) -> i32 {
let mut k = k as u32;
let mut counts = HashMap::new();
for value in arr {
counts
.entry(value)
.and_modify(|count: &mut u32| *count += 1)
.or_insert(1);
}
let mut queue = counts.into_values().map(Reverse).collect::<BinaryHeap<_>>();
while k != 0 {
let top = queue.peek_mut().unwrap();
if let Some(new_k) = k.checked_sub(top.0) {
PeekMut::pop(top);
k = new_k;
} else {
break;
}
}
queue.len() as _
}
}
// ------------------------------------------------------ snip ------------------------------------------------------ //
impl super::Solution for Solution {
fn find_least_num_of_unique_ints(arr: Vec<i32>, k: i32) -> i32 {
Self::find_least_num_of_unique_ints(arr, k)
}
}
#[cfg(test)]
mod tests {
#[test]
fn test_solution() {
super::super::tests::run::<super::Solution>();
}
}