[pull] master from youngyangyang04:master #103

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

4 changes: 4 additions & 0 deletions problems/0129.求根到叶子节点数字之和.md

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -320,8 +320,11 @@ TypeScript:
		```typescript
		function sumNumbers(root: TreeNode \| null): number {
		if (root === null) return 0;
	// 记录最终结果
		let resTotal: number = 0;
	// 记录路径中遇到的节点值
		const route: number[] = [];
	// 递归初始值
		route.push(root.val);
		recur(root, route);
		return resTotal;
Expand All		@@ -342,6 +345,7 @@ function sumNumbers(root: TreeNode \| null): number {
		};
		}
		function listToSum(nums: number[]): number {
	// 数组求和
		return Number(nums.join(''));
		}
		};
Expand Down

Navigation Menu