xinyin025/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-07-16 00:46:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'master' into master

Browse Source
This commit is contained in:
Yudong Jin
2023-01-11 19:26:19 +08:00
committed by GitHub
parent 9adc78a3fe 368bf0d23e
commit 7a53f1d082
237 changed files with 8270 additions and 1591 deletions
Download Patch File Download Diff File Expand all files Collapse all files
codes/typescript/module/ListNode.ts
+1 -1
View File
@@ -1,4 +1,4 @@
/*
/**
* File: ListNode.ts
* Created Time: 2022-12-10
* Author: Justin (xiefahit@gmail.com)
codes/typescript/module/PrintUtil.ts
+1 -1
View File
@@ -1,4 +1,4 @@
/*
/**
* File: PrintUtil.ts
* Created Time: 2022-12-13
* Author: Justin (xiefahit@gmail.com)
codes/typescript/module/TreeNode.ts
+5 -5
View File
@@ -1,4 +1,4 @@
/*
/**
* File: TreeNode.ts
* Created Time: 2022-12-13
* Author: Justin (xiefahit@gmail.com)
@@ -20,7 +20,7 @@ class TreeNode {
}
/**
* Generate a binary tree with an array
* Generate a binary tree given an array
* @param arr
* @return
*/
@@ -31,19 +31,19 @@ function arrToTree(arr: (number | null)[]): TreeNode | null {
const root = new TreeNode(arr[0] as number);
const queue = [root];
let i = 1;
let i = 0;
while (queue.length) {
let node = queue.shift() as TreeNode;
if (++i >= arr.length) break;
if (arr[i] !== null) {
node.left = new TreeNode(arr[i] as number);
queue.push(node.left);
}
i++;
if (++i >= arr.length) break;
if (arr[i] !== null) {
node.right = new TreeNode(arr[i] as number);
queue.push(node.right);
}
i++;
}
return root;
}