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

struct Solution;
use rustgym_util::*;

trait Preorder {
    fn preorder(&self, cur: &mut Vec<char>, min: &mut String);
}

impl Preorder for TreeLink {
    fn preorder(&self, cur: &mut Vec<char>, min: &mut String) {
        if let Some(node) = self {
            let node = node.borrow();
            let val = (node.val as u8 + b'a') as char;
            cur.push(val);
            if node.left.is_none() && node.right.is_none() {
                let s: String = cur.iter().rev().copied().collect();
                if min == "" {
                    *min = s;
                } else {
                    if s < *min {
                        *min = s;
                    }
                }
            }
            node.left.preorder(cur, min);
            node.right.preorder(cur, min);
            cur.pop();
        }
    }
}

impl Solution {
    fn smallest_from_leaf(root: TreeLink) -> String {
        let mut cur: Vec<char> = vec![];
        let mut res: String = "".to_string();
        root.preorder(&mut cur, &mut res);
        res
    }
}

#[test]
fn test() {
    let root = tree!(
        0,
        tree!(1, tree!(3), tree!(4)),
        tree!(2, tree!(3), tree!(4))
    );
    let res = "dba".to_string();
    assert_eq!(Solution::smallest_from_leaf(root), res);
    let root = tree!(
        25,
        tree!(1, tree!(1), tree!(3)),
        tree!(3, tree!(0), tree!(2))
    );
    let res = "adz".to_string();
    assert_eq!(Solution::smallest_from_leaf(root), res);
    let root = tree!(
        2,
        tree!(2, None, tree!(1, tree!(0), None)),
        tree!(1, tree!(0), None)
    );
    let res = "abc".to_string();
    assert_eq!(Solution::smallest_from_leaf(root), res);
}