algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-09 03:34:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0111.二叉树的最小深度.md

Browse Source
This commit is contained in:
fw_qaq
2022-11-13 23:22:47 +08:00
committed by GitHub
parent 8b26d8e193
commit ad5520612d
1 changed files with 17 additions and 20 deletions
Download Patch File Download Diff File Expand all files Collapse all files

37
problems/0111.二叉树的最小深度.md
View File

@ -591,33 +591,30 @@ impl Solution {
}
// 迭代
pub fn bfs(node: Option<Rc<RefCell<TreeNode>>>) -> i32{
let mut min_depth = 0;
if node.is_none(){
return min_depth
pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
let mut res = 0;
let mut queue = VecDeque::new();
if root.is_some() {
queue.push_back(root);
}
let mut stack = vec![node.unwrap()];
while !stack.is_empty(){
min_depth += 1;
let num = stack.len();
for _i in 0..num{
let top = stack.remove(0);
let left_child = top.borrow_mut().left.take();
let right_child = top.borrow_mut().right.take();
if left_child.is_none() && right_child.is_none(){
return min_depth;
while !queue.is_empty() {
res += 1;
for _ in 0..queue.len() {
let node = queue.pop_front().unwrap().unwrap();
if node.borrow().left.is_none() && node.borrow().right.is_none() {
return res;
}
if left_child.is_some(){
stack.push(left_child.unwrap());
if node.borrow().left.is_some() {
queue.push_back(node.borrow().left.clone());
}
if right_child.is_some(){
stack.push(right_child.unwrap());
if node.borrow().right.is_some() {
queue.push_back(node.borrow().right.clone());
}
}
}
min_depth
res
}
}
```
<p align="center">