rustgym 0.2.0

rustgym solutions
Documentation 
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

struct Solution;

use std::collections::HashMap;

impl Solution {
    fn subarrays_with_k_distinct(a: Vec<i32>, k: i32) -> i32 {
        (Self::at_most(&a, k) - Self::at_most(&a, k - 1)) as i32
    }

    fn at_most(a: &[i32], mut k: i32) -> usize {
        let n = a.len();
        let mut hm: HashMap<i32, i32> = HashMap::new();
        let mut j = 0;
        let mut res = 0;
        for i in 0..n {
            let count = hm.entry(a[i]).or_default();
            if *count == 0 {
                k -= 1;
            }
            *count += 1;
            while k < 0 {
                let count = hm.entry(a[j]).or_default();
                *count -= 1;
                if *count == 0 {
                    k += 1;
                }
                j += 1;
            }
            res += i - j + 1;
        }
        res
    }
}

#[test]
fn test() {
    let a = vec![1, 2, 1, 2, 3];
    let k = 2;
    let res = 7;
    assert_eq!(Solution::subarrays_with_k_distinct(a, k), res);
    let a = vec![1, 2, 1, 3, 4];
    let k = 3;
    let res = 3;
    assert_eq!(Solution::subarrays_with_k_distinct(a, k), res);
}