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

struct Solution;
use rustgym_util::*;

trait Leaves {
    fn preorder(&self, leaves: &mut Vec<i32>);
}

impl Leaves for TreeLink {
    fn preorder(&self, leaves: &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() {
                leaves.push(node.val);
            } else {
                left.preorder(leaves);
                right.preorder(leaves);
            }
        }
    }
}

impl Solution {
    fn leaf_similar(root1: TreeLink, root2: TreeLink) -> bool {
        let mut leaves1: Vec<i32> = vec![];
        let mut leaves2: Vec<i32> = vec![];
        root1.preorder(&mut leaves1);
        root2.preorder(&mut leaves2);
        leaves1 == leaves2
    }
}

#[test]
fn test() {
    let root1 = tree!(
        3,
        tree!(5, tree!(6), tree!(2, tree!(7), tree!(4))),
        tree!(1, tree!(9), tree!(8))
    );
    let root2 = tree!(
        4,
        tree!(5, tree!(6), tree!(2, tree!(7), tree!(4))),
        tree!(1, tree!(9), tree!(8))
    );
    assert_eq!(Solution::leaf_similar(root1, root2), true);
}