algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-11 04:54:51 +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:29:12 +08:00
committed by GitHub
parent ad5520612d
commit 46e1d0b907
1 changed files with 1 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -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();