mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
Merge pull request #1666 from initialqing/master
Update 0129.求根节点到叶节点数字之和.md
This commit is contained in:
@ -320,8 +320,11 @@ TypeScript:
|
|||||||
```typescript
|
```typescript
|
||||||
function sumNumbers(root: TreeNode | null): number {
|
function sumNumbers(root: TreeNode | null): number {
|
||||||
if (root === null) return 0;
|
if (root === null) return 0;
|
||||||
|
// 记录最终结果
|
||||||
let resTotal: number = 0;
|
let resTotal: number = 0;
|
||||||
|
// 记录路径中遇到的节点值
|
||||||
const route: number[] = [];
|
const route: number[] = [];
|
||||||
|
// 递归初始值
|
||||||
route.push(root.val);
|
route.push(root.val);
|
||||||
recur(root, route);
|
recur(root, route);
|
||||||
return resTotal;
|
return resTotal;
|
||||||
@ -342,6 +345,7 @@ function sumNumbers(root: TreeNode | null): number {
|
|||||||
};
|
};
|
||||||
}
|
}
|
||||||
function listToSum(nums: number[]): number {
|
function listToSum(nums: number[]): number {
|
||||||
|
// 数组求和
|
||||||
return Number(nums.join(''));
|
return Number(nums.join(''));
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
|
Reference in New Issue
Block a user