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

struct Solution;

impl Solution {
    fn longest_common_subsequence(text1: String, text2: String) -> i32 {
        let s1: Vec<char> = text1.chars().collect();
        let s2: Vec<char> = text2.chars().collect();
        let n1 = s1.len();
        let n2 = s2.len();
        let mut dp: Vec<Vec<usize>> = vec![vec![0; n2 + 1]; n1 + 1];
        for i in 0..n1 {
            for j in 0..n2 {
                if s1[i] == s2[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[n1][n2] as i32
    }
}

#[test]
fn test() {
    let text1 = "abcde".to_string();
    let text2 = "ace".to_string();
    let res = 3;
    assert_eq!(Solution::longest_common_subsequence(text1, text2), res);
    let text1 = "abc".to_string();
    let text2 = "abc".to_string();
    let res = 3;
    assert_eq!(Solution::longest_common_subsequence(text1, text2), res);
    let text1 = "abc".to_string();
    let text2 = "def".to_string();
    let res = 0;
    assert_eq!(Solution::longest_common_subsequence(text1, text2), res);
}