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

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

impl Solution {
    fn can_reach(arr: Vec<i32>, start: i32) -> bool {
        let n = arr.len();
        let mut visited = vec![false; n];
        let mut queue = VecDeque::new();
        queue.push_back(start);
        visited[start as usize] = true;
        while let Some(i) = queue.pop_front() {
            if arr[i as usize] == 0 {
                return true;
            } else {
                let l = i - arr[i as usize];
                let r = i + arr[i as usize];
                if l >= 0 && !visited[l as usize] {
                    visited[l as usize] = true;
                    queue.push_back(l);
                }
                if r < n as i32 && !visited[r as usize] {
                    visited[r as usize] = true;
                    queue.push_back(r);
                }
            }
        }
        false
    }
}

#[test]
fn test() {
    let arr = vec![4, 2, 3, 0, 3, 1, 2];
    let start = 5;
    let res = true;
    assert_eq!(Solution::can_reach(arr, start), res);
    let arr = vec![4, 2, 3, 0, 3, 1, 2];
    let start = 0;
    let res = true;
    assert_eq!(Solution::can_reach(arr, start), res);
    let arr = vec![3, 0, 2, 1, 2];
    let start = 2;
    let res = false;
    assert_eq!(Solution::can_reach(arr, start), res);
}