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

struct Solution;

impl Solution {
    fn longest_mountain(a: Vec<i32>) -> i32 {
        let n = a.len();
        if n == 0 {
            return 0;
        }
        let mut left = vec![0; n];
        let mut right = vec![0; n];
        for i in 1..n {
            if a[i] > a[i - 1] {
                left[i] = left[i - 1] + 1;
            }
        }
        for i in (0..n - 1).rev() {
            if a[i] > a[i + 1] {
                right[i] = right[i + 1] + 1;
            }
        }
        let mut res = 0;
        for i in 0..n {
            if left[i] > 0 && right[i] > 0 {
                res = res.max(left[i] + right[i] + 1);
            }
        }
        res
    }
}

#[test]
fn test() {
    let a = vec![2, 1, 4, 7, 3, 2, 5];
    let res = 5;
    assert_eq!(Solution::longest_mountain(a), res);
    let a = vec![2, 2, 2];
    let res = 0;
    assert_eq!(Solution::longest_mountain(a), res);
}