mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-10 20:40:39 +08:00
添加(二叉树中递归带着回溯.md):增加二叉树的不同路径的typescript版本
This commit is contained in:
@ -534,6 +534,27 @@ function isSameTree(p: TreeNode | null, q: TreeNode | null): boolean {
|
||||
> 二叉树的不同路径
|
||||
|
||||
```typescript
|
||||
function binaryTreePaths(root: TreeNode | null): string[] {
|
||||
function recur(node: TreeNode, nodeSeqArr: number[], resArr: string[]): void {
|
||||
nodeSeqArr.push(node.val);
|
||||
if (node.left === null && node.right === null) {
|
||||
resArr.push(nodeSeqArr.join('->'));
|
||||
}
|
||||
if (node.left !== null) {
|
||||
recur(node.left, nodeSeqArr, resArr);
|
||||
nodeSeqArr.pop();
|
||||
}
|
||||
if (node.right !== null) {
|
||||
recur(node.right, nodeSeqArr, resArr);
|
||||
nodeSeqArr.pop();
|
||||
}
|
||||
}
|
||||
let nodeSeqArr: number[] = [];
|
||||
let resArr: string[] = [];
|
||||
if (root === null) return resArr;
|
||||
recur(root, nodeSeqArr, resArr);
|
||||
return resArr;
|
||||
};
|
||||
```
|
||||
|
||||
|
||||
|
Reference in New Issue
Block a user