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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89

struct Solution;

impl Solution {
    fn order_of_largest_plus_sign(n: i32, mines: Vec<Vec<i32>>) -> i32 {
        let n = n as usize;
        let mut grid = vec![vec![1; n]; n];
        let mut left = vec![vec![0; n]; n];
        let mut top = vec![vec![0; n]; n];
        let mut right = vec![vec![0; n]; n];
        let mut bottom = vec![vec![0; n]; n];
        for mine in mines {
            let i = mine[0] as usize;
            let j = mine[1] as usize;
            grid[i][j] = 0;
        }
        for i in 0..n {
            for j in 0..n {
                if grid[i][j] == 1 {
                    if j > 0 {
                        left[i][j] = left[i][j - 1] + 1;
                    } else {
                        left[i][j] = 1;
                    }
                }
            }
        }
        for j in 0..n {
            for i in 0..n {
                if grid[i][j] == 1 {
                    if i > 0 {
                        top[i][j] = top[i - 1][j] + 1;
                    } else {
                        top[i][j] = 1;
                    }
                }
            }
        }
        for i in 0..n {
            for j in (0..n).rev() {
                if grid[i][j] == 1 {
                    if j + 1 < n {
                        right[i][j] = right[i][j + 1] + 1;
                    } else {
                        right[i][j] = 1;
                    }
                }
            }
        }
        for j in 0..n {
            for i in (0..n).rev() {
                if grid[i][j] == 1 {
                    if i + 1 < n {
                        bottom[i][j] = bottom[i + 1][j] + 1;
                    } else {
                        bottom[i][j] = 1;
                    }
                }
            }
        }
        let mut res = 0;
        for i in 0..n {
            for j in 0..n {
                let mut min = n;
                min = min.min(left[i][j]);
                min = min.min(right[i][j]);
                min = min.min(top[i][j]);
                min = min.min(bottom[i][j]);
                res = res.max(min);
            }
        }
        res as i32
    }
}

#[test]
fn test() {
    let n = 5;
    let mines = vec_vec_i32![[4, 2]];
    let res = 2;
    assert_eq!(Solution::order_of_largest_plus_sign(n, mines), res);
    let n = 2;
    let mines = vec_vec_i32![];
    let res = 1;
    assert_eq!(Solution::order_of_largest_plus_sign(n, mines), res);
    let n = 1;
    let mines = vec_vec_i32![[0, 0]];
    let res = 0;
    assert_eq!(Solution::order_of_largest_plus_sign(n, mines), res);
}