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

Merge pull request #2276 from gaokuo510/test

Browse Source 
修改代码中的错误
This commit is contained in:
程序员Carl
2023-09-21 11:27:55 +08:00
committed by GitHub
parent 828d796d41 839afd119b
commit 410bb6824e
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

@ -173,12 +173,12 @@ private:
int result; int result;
void getdepth(TreeNode* node, int depth) { void getdepth(TreeNode* node, int depth) {
// 函数递归终止条件 // 函数递归终止条件
if (root == nullptr) { if (node == nullptr) {
return; return;
} }
// 中，处理逻辑：判断是不是叶子结点 // 中，处理逻辑：判断是不是叶子结点
if (root -> left == nullptr && root->right == nullptr) { if (node -> left == nullptr && node->right == nullptr) {
res = min(res, depth); result = min(result, depth);
} }
if (node->left) { // 左 if (node->left) { // 左
getdepth(node->left, depth + 1); getdepth(node->left, depth + 1);