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

struct Solution;

use std::collections::VecDeque;

impl Solution {
    fn snakes_and_ladders(board: Vec<Vec<i32>>) -> i32 {
        let n = board.len();
        let mut moves: Vec<i32> = vec![0; n * n];
        let mut k = 0;
        for i in (0..n).rev() {
            if i % 2 != n % 2 {
                for j in 0..n {
                    moves[k] = board[i][j];
                    k += 1;
                }
            } else {
                for j in (0..n).rev() {
                    moves[k] = board[i][j];
                    k += 1;
                }
            }
        }
        let mut queue: VecDeque<usize> = VecDeque::new();
        let mut visited: Vec<usize> = vec![0; n * n];
        visited[0] = 1;
        queue.push_back(0);
        while let Some(i) = queue.pop_front() {
            if i == n * n - 1 {
                return visited[i] as i32 - 1;
            } else {
                for j in i + 1..=i + 6 {
                    if j >= n * n {
                        break;
                    }
                    let k = if moves[j] == -1 {
                        j
                    } else {
                        (moves[j] - 1) as usize
                    };
                    if visited[k] == 0 {
                        visited[k] = visited[i] + 1;
                        queue.push_back(k);
                    }
                }
            }
        }
        -1
    }
}

#[test]
fn test() {
    let board: Vec<Vec<i32>> = [
        [-1, -1, -1, -1, -1, -1],
        [-1, -1, -1, -1, -1, -1],
        [-1, -1, -1, -1, -1, -1],
        [-1, 35, -1, -1, 13, -1],
        [-1, -1, -1, -1, -1, -1],
        [-1, 15, -1, -1, -1, -1],
    ]
    .iter()
    .map(|v| v.to_vec())
    .collect();
    let res = 4;
    assert_eq!(Solution::snakes_and_ladders(board), res);
    let board: Vec<Vec<i32>> = [
        [-1, -1, 19, 10, -1],
        [2, -1, -1, 6, -1],
        [-1, 17, -1, 19, -1],
        [25, -1, 20, -1, -1],
        [-1, -1, -1, -1, 15],
    ]
    .iter()
    .map(|v| v.to_vec())
    .collect();
    let res = 2;
    assert_eq!(Solution::snakes_and_ladders(board), res);
}