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 {
 <a href="https://programmercarl.com/other/kstar.html" target="_blank">
   <img src="../pics/网站星球宣传海报.jpg" width="1000"/>
 </a>
+