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
46
47
48

struct Solution;
use rustgym_util::*;

trait Postorder {
    fn postorder(&self, max: &mut usize) -> Option<(i32, usize)>;
}

impl Postorder for TreeLink {
    fn postorder(&self, max: &mut usize) -> Option<(i32, usize)> {
        if let Some(node) = self {
            let node = node.borrow();
            let val = node.val;
            let mut length = 1;
            if let Some(left) = node.left.postorder(max) {
                if val + 1 == left.0 {
                    length = length.max(left.1 + 1);
                }
            }
            if let Some(right) = node.right.postorder(max) {
                if val + 1 == right.0 {
                    length = length.max(right.1 + 1);
                }
            }
            *max = (*max).max(length);
            Some((val, length))
        } else {
            None
        }
    }
}

impl Solution {
    fn longest_consecutive(root: TreeLink) -> i32 {
        let mut res = 0;
        root.postorder(&mut res);
        res as i32
    }
}

#[test]
fn test() {
    let root = tree!(1, None, tree!(3, tree!(2), tree!(4, None, tree!(5))));
    let res = 3;
    assert_eq!(Solution::longest_consecutive(root), res);
    let root = tree!(2, None, tree!(3, tree!(2, tree!(1), None), None));
    let res = 2;
    assert_eq!(Solution::longest_consecutive(root), res);
}