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

Merge pull request #2533 from VoxDai/patch-1

Browse Source 
Update 0111.二叉树的最小深度.md / Fix typo
This commit is contained in:
程序员Carl
2024-05-14 10:30:39 +08:00
committed by GitHub
parent ba12ff6932 9fdaeb5b90
commit 56a7c68610
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -64,7 +64,7 @@
代码如下： 代码如下：
``` ```CPP
int getDepth(TreeNode* node) int getDepth(TreeNode* node)
``` ```
@ -74,14 +74,14 @@ int getDepth(TreeNode* node)
代码如下： 代码如下：
``` ```CPP
if (node == NULL) return 0; if (node == NULL) return 0;
``` ```
3. 确定单层递归的逻辑 3. 确定单层递归的逻辑
这块和求最大深度可就不一样了，一些同学可能会写如下代码： 这块和求最大深度可就不一样了，一些同学可能会写如下代码：
``` ```CPP
int leftDepth = getDepth(node->left); int leftDepth = getDepth(node->left);
int rightDepth = getDepth(node->right); int rightDepth = getDepth(node->right);
int result = 1 + min(leftDepth, rightDepth); int result = 1 + min(leftDepth, rightDepth);