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

struct Solution;

impl Solution {
    fn calculate_minimum_hp(dungeon: Vec<Vec<i32>>) -> i32 {
        let n = dungeon.len();
        let m = dungeon[0].len();
        let mut dp = vec![vec![0; m]; n];
        for i in (0..n).rev() {
            for j in (0..m).rev() {
                if i + 1 < n && j + 1 < m {
                    dp[i][j] = 1.max(-dungeon[i][j] + dp[i + 1][j].min(dp[i][j + 1]));
                    continue;
                }
                if i + 1 < n {
                    dp[i][j] = 1.max(-dungeon[i][j] + dp[i + 1][j]);
                    continue;
                }
                if j + 1 < m {
                    dp[i][j] = 1.max(-dungeon[i][j] + dp[i][j + 1]);
                    continue;
                }
                dp[i][j] = 1.max(-dungeon[i][j] + 1);
            }
        }
        dp[0][0]
    }
}

#[test]
fn test() {
    let dungeon = vec_vec_i32![[-2, -3, 3], [-5, -10, 1], [10, 30, -5]];
    let res = 7;
    assert_eq!(Solution::calculate_minimum_hp(dungeon), res);
}