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

struct Solution;
use rustgym_util::*;
use std::collections::HashMap;

trait Preorder {
    fn preorder(&self, level: usize, sum: &mut HashMap<usize, i32>);
}

impl Preorder for TreeLink {
    fn preorder(&self, level: usize, sum: &mut HashMap<usize, i32>) {
        if let Some(node) = self {
            let val = node.borrow().val;
            *sum.entry(level).or_default() += val;
            let left = &node.borrow().left;
            let right = &node.borrow().right;
            left.preorder(level + 1, sum);
            right.preorder(level + 1, sum);
        }
    }
}

impl Solution {
    fn max_level_sum(root: TreeLink) -> i32 {
        let mut sum = HashMap::new();
        root.preorder(1, &mut sum);
        *sum.iter().max_by_key(|(_, &v)| v).unwrap().0 as i32
    }
}

#[test]
fn test() {
    let root = tree!(1, tree!(7, tree!(7), tree!(-8)), tree!(0));
    let res = 2;
    assert_eq!(Solution::max_level_sum(root), res);
}