From de017e95441ece804182aec87cfba7f4414cc4a7 Mon Sep 17 00:00:00 2001
From: zihao Tan <53686585+Tcotyledons@users.noreply.github.com>
Date: Thu, 29 Sep 2022 09:41:25 +0800
Subject: [PATCH] =?UTF-8?q?Update=200104.=E4=BA=8C=E5=8F=89=E6=A0=91?=
 =?UTF-8?q?=E7=9A=84=E6=9C=80=E5=A4=A7=E6=B7=B1=E5=BA=A6.md?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

104二叉树最大深度贡献java版本的从深度角度的递归法
---
 problems/0104.二叉树的最大深度.md | 25 +++++++++++++++++++++++
 1 file changed, 25 insertions(+)

diff --git a/problems/0104.二叉树的最大深度.md b/problems/0104.二叉树的最大深度.md
index 2bcc9c5c..bcf3a4a3 100644
--- a/problems/0104.二叉树的最大深度.md
+++ b/problems/0104.二叉树的最大深度.md
@@ -313,6 +313,31 @@ class solution {
 }
 ```
 
+```java
+class Solution {
+  /**
+   * 递归法(求深度法)
+   */
+    //定义最大深度
+    int maxnum = 0;
+
+    public int maxDepth(TreeNode root) {
+        ans(root,0);
+        return maxnum;
+    }
+    
+    //递归求解最大深度
+    void ans(TreeNode tr,int tmp){
+        if(tr==null) return;
+        tmp++;
+        maxnum = maxnum<tmp?tmp:maxnum;
+        ans(tr.left,tmp);
+        ans(tr.right,tmp);
+        tmp--;
+    }
+}
+```
+
 ```java
 class solution {
     /**