From 49fc701e4897acd528e60ac9a67d0d85772dbb5b Mon Sep 17 00:00:00 2001 From: huhaonan <812559558@qq.com> Date: Thu, 5 Jan 2023 21:42:53 +0800 Subject: [PATCH] =?UTF-8?q?UPDATE=200222=20=E4=BF=AE=E6=94=B9=E5=85=B6?= =?UTF-8?q?=E4=B8=AD=E4=B8=A4=E4=B8=AA=E9=94=99=E5=88=AB=E5=AD=97?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- problems/0222.完全二叉树的节点个数.md | 3 ++- 1 file changed, 2 insertions(+), 1 deletion(-) diff --git a/problems/0222.完全二叉树的节点个数.md b/problems/0222.完全二叉树的节点个数.md index b87877c9..10ac8264 100644 --- a/problems/0222.完全二叉树的节点个数.md +++ b/problems/0222.完全二叉树的节点个数.md @@ -188,7 +188,7 @@ public: ```CPP if (root == nullptr) return 0; -// 开始根据做深度和有深度是否相同来判断该子树是不是满二叉树 +// 开始根据左深度和右深度是否相同来判断该子树是不是满二叉树 TreeNode* left = root->left; TreeNode* right = root->right; int leftDepth = 0, rightDepth = 0; // 这里初始为0是有目的的，为了下面求指数方便 @@ -843,3 +843,4 @@ impl Solution { +