dsalgo 0.3.10

A package for Datastructures and Algorithms.
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

/// from 1-indexed dp table

pub fn find_all_ends(dp: &[Vec<usize>]) -> Vec<(usize, usize)> {
    let mut mx = 0;

    for row in dp.iter() {
        mx = mx.max(*row.iter().max().unwrap());
    }

    let mut ends = vec![];

    if mx == 0 {
        return ends;
    }

    for (i, row) in dp.iter().enumerate() {
        for (j, &lcs) in row.iter().enumerate() {
            if lcs == mx {
                ends.push((i - 1, j - 1));
            }
        }
    }

    ends
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        use crate::longest_common_substring_table::*;

        let cases = vec![(("aabbcc", "ccbbaa"), vec![(1, 5), (3, 3), (5, 1)])];

        for ((s, t), ans) in cases {
            assert_eq!(
                find_all_ends(&longest_common_substring(
                    s.as_bytes(),
                    t.as_bytes()
                )),
                ans
            );
        }
    }
}