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

use std::cmp::Reverse;
use std::collections::BinaryHeap;

struct KthLargest {
    pq: BinaryHeap<Reverse<i32>>,
    k: usize,
}

impl KthLargest {
    fn new(k: i32, nums: Vec<i32>) -> Self {
        let mut pq: BinaryHeap<Reverse<i32>> = BinaryHeap::new();
        let k = k as usize;
        for x in nums {
            pq.push(Reverse(x));
            if pq.len() > k {
                pq.pop();
            }
        }
        KthLargest { pq, k }
    }

    fn add(&mut self, val: i32) -> i32 {
        self.pq.push(Reverse(val));
        if self.pq.len() > self.k {
            self.pq.pop();
        }
        let x = *self.pq.peek().unwrap();
        x.0
    }
}

#[test]
fn test() {
    let k = 3;
    let nums = vec![4, 5, 8, 2];
    let mut obj = KthLargest::new(k, nums);
    assert_eq!(obj.add(3), 4);
    assert_eq!(obj.add(5), 5);
    assert_eq!(obj.add(10), 5);
    assert_eq!(obj.add(9), 8);
    assert_eq!(obj.add(4), 8);
}