Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit a5ee6b0

Browse files
Merge remote-tracking branch 'upstream/master'
2 parents e4ca348 + f438788 commit a5ee6b0

File tree

2 files changed

+29
-0
lines changed

2 files changed

+29
-0
lines changed

‎problems/0104.二叉树的最大深度.md‎

Lines changed: 25 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -313,6 +313,31 @@ class solution {
313313
}
314314
```
315315

316+
```java
317+
class Solution {
318+
/**
319+
* 递归法(求深度法)
320+
*/
321+
//定义最大深度
322+
int maxnum = 0;
323+
324+
public int maxDepth(TreeNode root) {
325+
ans(root,0);
326+
return maxnum;
327+
}
328+
329+
//递归求解最大深度
330+
void ans(TreeNode tr,int tmp){
331+
if(tr==null) return;
332+
tmp++;
333+
maxnum = maxnum<tmp?tmp:maxnum;
334+
ans(tr.left,tmp);
335+
ans(tr.right,tmp);
336+
tmp--;
337+
}
338+
}
339+
```
340+
316341
```java
317342
class solution {
318343
/**

‎problems/0129.求根到叶子节点数字之和.md‎

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -320,8 +320,11 @@ TypeScript:
320320
```typescript
321321
function sumNumbers(root: TreeNode | null): number {
322322
if (root === null) return 0;
323+
// 记录最终结果
323324
let resTotal: number = 0;
325+
// 记录路径中遇到的节点值
324326
const route: number[] = [];
327+
// 递归初始值
325328
route.push(root.val);
326329
recur(root, route);
327330
return resTotal;
@@ -342,6 +345,7 @@ function sumNumbers(root: TreeNode | null): number {
342345
};
343346
}
344347
function listToSum(nums: number[]): number {
348+
// 数组求和
345349
return Number(nums.join(''));
346350
}
347351
};

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /