learning
/
leetcode-master
mirror of https://github.com/youngyangyang04/leetcode-master.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #1509 from coderwei99/master 

fix: 修改第111题二叉树最小深度js代码
This commit is contained in:
程序员Carl 2022-08-01 10:57:34 +08:00 committed by GitHub
parent f23bea5e44 34d42447d9
commit 98db90f081
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -372,7 +372,7 @@ var minDepth1 = function(root) {
// 到叶子节点 返回 1 // 到叶子节点 返回 1
if(!root.left && !root.right) return 1; if(!root.left && !root.right) return 1;
// 只有右节点时 递归右节点 // 只有右节点时 递归右节点
if(!root.left) return 1 + minDepth(root.right);、 if(!root.left) return 1 + minDepth(root.right);
// 只有左节点时 递归左节点 // 只有左节点时 递归左节点
if(!root.right) return 1 + minDepth(root.left); if(!root.right) return 1 + minDepth(root.left);
return Math.min(minDepth(root.left), minDepth(root.right)) + 1; return Math.min(minDepth(root.left), minDepth(root.right)) + 1;