github_mirrors/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-02-02 22:43:50 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update ts code and docs

Browse Source
This commit is contained in:
gyt95 2022-12-16 16:33:12 +08:00
parent 45aca03b92
commit 84caa60cd4
2 changed files with 10 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
codes/typescript/chapter_computational_complexity/leetcode_two_sum.ts
View File

@ -5,7 +5,7 @@
*/
function twoSumBruteForce(nums: number[], target: number): number[] {
let n = nums.length;
const n = nums.length;
// 两层循环，时间复杂度 O(n^2)
for (let i = 0; i < n; i++) {
for (let j = i + 1; j < n; j++) {
@ -33,10 +33,12 @@ function twoSumHashTable(nums: number[], target: number): number[] {
};
/* Driver Code */
let nums = [2, 7, 11, 15], target = 9;
twoSumBruteForce(nums, target)
console.log("使用暴力枚举后得到结果：", nums)
// 方法一
const nums = [2, 7, 11, 15], target = 9;
let nums1 = [2, 7, 11, 15], target1 = 9;
twoSumHashTable(nums1, target1)
console.log("使用辅助哈希表后得到结果", nums1)
let res = twoSumBruteForce(nums, target);
console.log("方法一 res = ", res);
// 方法二
res = twoSumHashTable(nums, target);
console.log("方法二 res = ", res);

2
docs/chapter_computational_complexity/space_time_tradeoff.md
View File

@ -97,7 +97,7 @@ comments: true
```typescript title="leetcode_two_sum.ts"
function twoSumBruteForce(nums: number[], target: number): number[] {
let n = nums.length;
const n = nums.length;
// 两层循环，时间复杂度 O(n^2)
for (let i = 0; i < n; i++) {
for (let j = i + 1; j < n; j++) {