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

struct Solution;

impl Solution {
    fn max_uncrossed_lines(a: Vec<i32>, b: Vec<i32>) -> i32 {
        let n = a.len();
        let m = b.len();
        let mut dp = vec![vec![0; m + 1]; n + 1];
        for i in 0..n {
            for j in 0..m {
                if a[i] == b[j] {
                    dp[i + 1][j + 1] = dp[i][j] + 1;
                } else {
                    dp[i + 1][j + 1] = dp[i][j + 1].max(dp[i + 1][j]);
                }
            }
        }
        dp[n][m]
    }
}

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