-
Notifications
You must be signed in to change notification settings - Fork 2
/
hPov7L.rs
64 lines (53 loc) · 1.47 KB
/
hPov7L.rs
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
64
#![allow(dead_code, unused, unused_variables, non_snake_case)]
fn main() {}
struct Solution;
// Definition for a binary tree node.
#[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;
use std::vec;
impl Solution {
pub fn largest_values(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
let mut stack = vec![];
let mut ans = vec![];
if root.is_some() {
stack.push(root);
}
while !stack.is_empty() {
let mut new_stack = vec![];
let mut max = 0;
for (i, node) in stack.into_iter().enumerate() {
let node = node.unwrap();
if node.borrow().left.is_some() {
new_stack.push(node.borrow_mut().left.take());
}
if node.borrow().right.is_some() {
new_stack.push(node.borrow_mut().right.take());
}
if i == 0 {
max = node.borrow().val;
} else {
max = max.max(node.borrow().val);
}
}
stack = new_stack;
ans.push(max);
}
ans
}
}