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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85

struct Solution;
use rustgym_util::*;

trait Boundry {
    fn left_boundry(&self, nodes: &mut Vec<i32>);
    fn bottom_boundry(&self, nodes: &mut Vec<i32>);
    fn right_boundry(&self, nodes: &mut Vec<i32>);
}

impl Boundry for TreeLink {
    fn left_boundry(&self, nodes: &mut Vec<i32>) {
        if let Some(node) = self {
            let node = node.borrow();
            let left = &node.left;
            let right = &node.right;
            if left.is_some() || right.is_some() {
                nodes.push(node.val);
            }
            if left.is_some() {
                left.left_boundry(nodes);
            } else {
                right.left_boundry(nodes);
            }
        }
    }
    fn bottom_boundry(&self, nodes: &mut Vec<i32>) {
        if let Some(node) = self {
            let node = node.borrow();
            let left = &node.left;
            let right = &node.right;
            if left.is_none() && right.is_none() {
                nodes.push(node.val);
            } else {
                left.bottom_boundry(nodes);
                right.bottom_boundry(nodes);
            }
        }
    }
    fn right_boundry(&self, nodes: &mut Vec<i32>) {
        if let Some(node) = self {
            let node = node.borrow();
            let left = &node.left;
            let right = &node.right;
            if right.is_some() {
                right.right_boundry(nodes);
            } else {
                left.right_boundry(nodes);
            }
            if left.is_some() || right.is_some() {
                nodes.push(node.val);
            }
        }
    }
}

impl Solution {
    fn boundary_of_binary_tree(root: TreeLink) -> Vec<i32> {
        let mut res: Vec<i32> = vec![];
        if let Some(node) = root {
            let node = node.borrow();
            res.push(node.val);
            node.left.left_boundry(&mut res);
            node.left.bottom_boundry(&mut res);
            node.right.bottom_boundry(&mut res);
            node.right.right_boundry(&mut res);
        } else {
            return vec![];
        }
        res
    }
}

#[test]
fn test() {
    let root = tree!(1, None, tree!(2, tree!(3), tree!(4)));
    let res = vec![1, 3, 4, 2];
    assert_eq!(Solution::boundary_of_binary_tree(root), res);
    let root = tree!(
        1,
        tree!(2, tree!(4), tree!(5, tree!(7), tree!(8))),
        tree!(3, tree!(6, tree!(9), tree!(10)), None)
    );
    let res = vec![1, 2, 4, 7, 8, 9, 10, 6, 3];
    assert_eq!(Solution::boundary_of_binary_tree(root), res);
}