mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-11 04:54:51 +08:00
Update 0111.二叉树的最小深度.md
This commit is contained in:
@ -591,6 +591,7 @@ impl Solution {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// 迭代
|
// 迭代
|
||||||
|
// 需要 use std::collections::VecDeque;
|
||||||
pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
|
pub fn min_depth(root: Option<Rc<RefCell<TreeNode>>>) -> i32 {
|
||||||
let mut res = 0;
|
let mut res = 0;
|
||||||
let mut queue = VecDeque::new();
|
let mut queue = VecDeque::new();
|
||||||
|
Reference in New Issue
Block a user