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

UPDATE 0222 修改其中两个错别字

Browse Source
This commit is contained in:
huhaonan
2023-01-05 21:42:53 +08:00
parent 2863a699cc
commit 49fc701e48
1 changed files with 2 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
problems/0222.完全二叉树的节点个数.md
View File

@ -188,7 +188,7 @@ public:
```CPP ```CPP
if (root == nullptr) return 0; if (root == nullptr) return 0;
// 开始根据做深度和有深度是否相同来判断该子树是不是满二叉树 // 开始根据左深度和右深度是否相同来判断该子树是不是满二叉树
TreeNode* left = root->left; TreeNode* left = root->left;
TreeNode* right = root->right; TreeNode* right = root->right;
int leftDepth = 0, rightDepth = 0; // 这里初始为0是有目的的，为了下面求指数方便 int leftDepth = 0, rightDepth = 0; // 这里初始为0是有目的的，为了下面求指数方便
@ -843,3 +843,4 @@ impl Solution {
<a href="https://programmercarl.com/other/kstar.html" target="_blank"> <a href="https://programmercarl.com/other/kstar.html" target="_blank">
<img src="../pics/网站星球宣传海报.jpg" width="1000"/> <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
</a> </a>