From 103256a36a20fa48514f3d6cb2516fecda681c68 Mon Sep 17 00:00:00 2001
From: xin <oncwnuN1VCJ08Bt_EFHQkrbYfrSE@git.weixin.qq.com>
Date: Wed, 15 Nov 2023 08:34:47 +0800
Subject: [PATCH] =?UTF-8?q?update:=20=E6=9B=B4=E6=96=B00104.=E4=BA=8C?=
 =?UTF-8?q?=E5=8F=89=E6=A0=91=E7=9A=84=E6=9C=80=E5=A4=A7=E6=B7=B1=E5=BA=A6?=
 =?UTF-8?q?=E9=87=8C=E7=9A=84=20n=20=E5=8F=89=E6=A0=91=E6=9C=80=E5=A4=A7?=
 =?UTF-8?q?=E6=B7=B1=E5=BA=A6=E7=9A=84=20ts=20=E8=A7=A3=E6=B3=95=EF=BC=8C?=
 =?UTF-8?q?=E5=8E=9F=E6=9C=AC=E4=BB=A3=E7=A0=81=E4=B8=8D=E8=83=BD=E9=80=9A?=
 =?UTF-8?q?=E8=BF=87=20leetcode=20=E6=B5=8B=E8=AF=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 problems/0104.二叉树的最大深度.md | 42 ++++++++++++++---------
 1 file changed, 26 insertions(+), 16 deletions(-)

diff --git a/problems/0104.二叉树的最大深度.md b/problems/0104.二叉树的最大深度.md
index 05044375..b115762e 100644
--- a/problems/0104.二叉树的最大深度.md
+++ b/problems/0104.二叉树的最大深度.md
@@ -738,26 +738,36 @@ function maxDepth(root: TreeNode | null): number {
 
 ```typescript
 // 后续遍历（自下而上）
-function maxDepth(root: TreeNode | null): number {
-    if (root === null) return 0;
-    return Math.max(maxDepth(root.left), maxDepth(root.right)) + 1;
-};
+function maxDepth(root: Node | null): number {
+    if (root === null) return 0
+    let depth = 0
+    for (let i = 0; i < root.children.length; i++) {
+        depth = Math.max(depth, maxDepth(root.children[i]))
+    }
+    return depth + 1
+}
 
 // 前序遍历(自上而下)
-function maxDepth(root: TreeNode | null): number {
-    function recur(node: TreeNode | null, count: number) {
-        if (node === null) {
-            resMax = resMax > count ? resMax : count;
-            return;
+function maxDepth(root: Node | null): number {
+    if (root === null) return 0
+
+    let depth: number = 0
+    const queue: Array<Node | null> = []
+    queue.push(root)
+
+    while (queue.length > 0) {
+        let len = queue.length
+        depth++
+        for (let i = 0; i < len; i++) {
+            // 当前层遍历
+            let curNode: Node | null = queue.shift()!
+                for (let j = 0; j < curNode.children.length; j++) {
+                    if (curNode.children[j]) queue.push(curNode.children[j])
+                }
         }
-        recur(node.left, count + 1);
-        recur(node.right, count + 1);
     }
-    let resMax: number = 0;
-    let count: number = 0;
-    recur(root, count);
-    return resMax;
-};
+    return depth
+}
 
 
 ```