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

test

Browse Source
This commit is contained in:
高阔
2023-09-09 10:23:43 +08:00
parent bf51d4730d
commit 839afd119b
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;
void getdepth(TreeNode* node, int depth) {
// 函数递归终止条件
if (root == nullptr) {
if (node == nullptr) {
return;
}
// 中，处理逻辑：判断是不是叶子结点
if (root -> left == nullptr && root->right == nullptr) {
res = min(res, depth);
if (node -> left == nullptr && node->right == nullptr) {
result = min(result, depth);
}
if (node->left) { // 左
getdepth(node->left, depth + 1);