blob: 6aec321bc37b7e79f5c950c27572d2e2b064a0a0 (
plain)
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
|
#[derive(Debug, PartialEq, Eq)]
pub struct TreeNode {
pub val: i32,
pub left: Option<Rc<RefCell<TreeNode>>>,
pub right: Option<Rc<RefCell<TreeNode>>>,
}
impl TreeNode {
#[inline]
pub fn new(val: i32) -> Self {
TreeNode {
val,
left: None,
right: None,
}
}
}
use std::cell::RefCell;
use std::rc::Rc;
const MOD: i64 = 1_000_000_007;
impl Solution {
pub fn max_product(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
let mut sums = Vec::new();
Self::dfs(&root, &mut sums);
((0..sums.len() - 1)
.map(|i| sums[i] * (sums[sums.len() - 1] - sums[i]))
.max()
.unwrap()
% MOD) as i32
}
fn dfs(node: &Option<Rc<RefCell<TreeNode>>>, sums: &mut Vec<i64>) -> i64 {
if let Some(n) = node {
let sum = n.borrow().val as i64
+ Self::dfs(&n.borrow().left, sums)
+ Self::dfs(&n.borrow().right, sums);
sums.push(sum);
sum
} else {
0
}
}
}
|