20240615 Finished

This commit is contained in:
jackfiled 2024-06-15 11:09:07 +08:00
parent 44600f360b
commit f2978f1431
2 changed files with 75 additions and 1 deletions

View File

@ -148,4 +148,5 @@ mod p112_path_sum;
mod p129_sum_root_to_leaf_numbers;
mod p124_binary_tree_maximum_path_sum;
mod p173_binary_search_tree_iterator;
mod p222_count_complete_tree_nodes;
mod p222_count_complete_tree_nodes;
mod p199_binary_tree_right_side_view;

View File

@ -0,0 +1,73 @@
/**
* [199] Binary Tree Right Side View
*/
pub struct Solution {}
use crate::util::tree::{TreeNode, to_tree};
// submission codes start here
// 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::rc::Rc;
use std::cell::RefCell;
use std::collections::VecDeque;
impl Solution {
pub fn right_side_view(root: Option<Rc<RefCell<TreeNode>>>) -> Vec<i32> {
let mut result = vec![];
let mut queue = VecDeque::new();
if let Some(root) = root {
queue.push_back(root);
}
while !queue.is_empty() {
let length = queue.len();
for i in 0..length {
let node = queue.pop_front().unwrap();
if i == length - 1 {
result.push(node.borrow().val);
}
if let Some(left) = &node.borrow().left {
queue.push_back(Rc::clone(left));
};
if let Some(right) = &node.borrow().right {
queue.push_back(Rc::clone(right));
};
}
}
result
}
}
// submission codes end
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_199() {
}
}