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

struct Solution;
use rustgym_util::*;

impl Solution {
    fn all_possible_fbt(n: i32) -> Vec<TreeLink> {
        if n % 2 == 0 {
            return vec![];
        }
        if n == 1 {
            vec![tree!(0)]
        } else {
            let mut res = vec![];
            let mut l = 1;
            let mut r = n - 1 - l;
            while r > 0 {
                let left_trees = Self::all_possible_fbt(l);
                let right_trees = Self::all_possible_fbt(r);
                for left in &left_trees {
                    for right in &right_trees {
                        res.push(tree!(0, left.clone(), right.clone()));
                    }
                }
                r -= 2;
                l += 2;
            }
            res
        }
    }
}

#[test]
fn test() {
    let n = 7;
    let res = [
        tree!(
            0,
            tree!(0),
            tree!(0, tree!(0), tree!(0, tree!(0), tree!(0)))
        ),
        tree!(
            0,
            tree!(0),
            tree!(0, tree!(0, tree!(0), tree!(0)), tree!(0))
        ),
        tree!(
            0,
            tree!(0, tree!(0), tree!(0)),
            tree!(0, tree!(0), tree!(0))
        ),
        tree!(
            0,
            tree!(0, tree!(0), tree!(0, tree!(0), tree!(0))),
            tree!(0)
        ),
        tree!(
            0,
            tree!(0, tree!(0, tree!(0), tree!(0)), tree!(0)),
            tree!(0)
        ),
    ];
    assert_eq!(Solution::all_possible_fbt(n), res);
}