From 3652d00e542fc251d479a66eb676c8e1ac910f45 Mon Sep 17 00:00:00 2001
From: Luo <82520819+Jerry-306@users.noreply.github.com>
Date: Thu, 24 Feb 2022 17:49:15 +0800
Subject: [PATCH] =?UTF-8?q?0104=20=E4=BA=8C=E5=8F=89=E6=A0=91=E6=9C=80?=
 =?UTF-8?q?=E5=A4=A7=E6=B7=B1=E5=BA=A6=20=E9=83=A8=E5=88=86=E4=BB=A3?=
 =?UTF-8?q?=E7=A0=81=E4=B9=A6=E5=86=99=E9=94=99=E8=AF=AF=E7=BA=A0=E6=AD=A3?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

函数错误，逻辑错误
---
 problems/0104.二叉树的最大深度.md | 10 ++++++----
 1 file changed, 6 insertions(+), 4 deletions(-)

diff --git a/problems/0104.二叉树的最大深度.md b/problems/0104.二叉树的最大深度.md
index 3eecdc92..2229a854 100644
--- a/problems/0104.二叉树的最大深度.md
+++ b/problems/0104.二叉树的最大深度.md
@@ -523,8 +523,8 @@ func maxdepth(root *treenode) int {
 
 ```javascript
 var maxdepth = function(root) {
-    if (!root) return root
-    return 1 + math.max(maxdepth(root.left), maxdepth(root.right))
+    if (root === null) return 0;
+    return 1 + Math.max(maxdepth(root.left), maxdepth(root.right))
 };
 ```
 
@@ -541,7 +541,7 @@ var maxdepth = function(root) {
     //3. 确定单层逻辑
         let leftdepth=getdepth(node.left);
         let rightdepth=getdepth(node.right);
-        let depth=1+math.max(leftdepth,rightdepth);
+        let depth=1+Math.max(leftdepth,rightdepth);
         return depth;
     }
     return getdepth(root);
@@ -591,7 +591,9 @@ var maxDepth = function(root) {
         count++
         while(size--) {
             let node = queue.shift()
-            node && (queue = [...queue, ...node.children])
+            for (let item of node.children) {
+                item && queue.push(item);
+            }
         }
     }
     return count