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

struct Solution;
use std::collections::VecDeque;

impl Solution {
    fn shortest_distance(maze: Vec<Vec<i32>>, start: Vec<i32>, destination: Vec<i32>) -> i32 {
        let n = maze.len();
        let m = maze[0].len();
        let r = start[0] as usize;
        let c = start[1] as usize;
        let x = destination[0] as usize;
        let y = destination[1] as usize;
        let mut dist: Vec<Vec<i32>> = vec![vec![-1; m]; n];
        let mut queue: VecDeque<(usize, usize, i32)> = VecDeque::new();
        queue.push_back((r, c, 0));
        while let Some((i, j, d)) = queue.pop_front() {
            if dist[i][j] != -1 && d >= dist[i][j] {
                continue;
            }
            dist[i][j] = d;
            let mut step = 0;
            let mut di = i;
            while di > 0 && maze[di - 1][j] == 0 {
                step += 1;
                di -= 1;
            }
            queue.push_back((di, j, d + step));

            let mut step = 0;
            let mut dj = j;
            while dj > 0 && maze[i][dj - 1] == 0 {
                step += 1;
                dj -= 1;
            }
            queue.push_back((i, dj, d + step));

            let mut step = 0;
            let mut di = i;
            while di + 1 < n && maze[di + 1][j] == 0 {
                step += 1;
                di += 1;
            }
            queue.push_back((di, j, d + step));

            let mut step = 0;
            let mut dj = j;
            while dj + 1 < m && maze[i][dj + 1] == 0 {
                step += 1;
                dj += 1;
            }
            queue.push_back((i, dj, d + step));
        }
        dist[x][y]
    }
}

#[test]
fn test() {
    let maze: Vec<Vec<i32>> = vec_vec_i32![
        [0, 0, 1, 0, 0],
        [0, 0, 0, 0, 0],
        [0, 0, 0, 1, 0],
        [1, 1, 0, 1, 1],
        [0, 0, 0, 0, 0]
    ];
    let start = vec![0, 4];
    let destination = vec![4, 4];
    let res = 12;
    assert_eq!(Solution::shortest_distance(maze, start, destination), res);
    let maze: Vec<Vec<i32>> = vec_vec_i32![
        [0, 0, 1, 0, 0],
        [0, 0, 0, 0, 0],
        [0, 0, 0, 1, 0],
        [1, 1, 0, 1, 1],
        [0, 0, 0, 0, 0]
    ];
    let start = vec![0, 4];
    let destination = vec![3, 2];
    let res = -1;
    assert_eq!(Solution::shortest_distance(maze, start, destination), res);
}