Oct 1, 2022 · Sep 28, 2022 · Sep 29, 2022 · Oct 1, 2022 · Oct 1, 2022 · Sep 29, 2022
diff --git a/problems/0104.二叉树的最大深度.md b/problems/0104.二叉树的最大深度.md
Original file line number	Diff line number	Diff line change
Expand Up		@@ -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 {
		/**
Expand Down