mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-07 15:45:40 +08:00
Merge remote-tracking branch 'upstream/master'
This commit is contained in:
@ -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 {
|
||||
/**
|
||||
|
@ -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;
|
||||
@ -342,6 +345,7 @@ function sumNumbers(root: TreeNode | null): number {
|
||||
};
|
||||
}
|
||||
function listToSum(nums: number[]): number {
|
||||
// 数组求和
|
||||
return Number(nums.join(''));
|
||||
}
|
||||
};
|
||||
|
Reference in New Issue
Block a user