fuhouyin/hello-algo
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Fix two_sum.js and .ts

Browse Source
This commit is contained in:
krahets 2023-06-16 21:28:48 +08:00
parent 29e6617ec1
commit d62156fb58
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
codes/javascript/chapter_searching/two_sum.js
View File

@ -24,10 +24,10 @@ function twoSumHashTable(nums, target) {
let m = {}; let m = {};
// 单层循环，时间复杂度 O(n) // 单层循环，时间复杂度 O(n)
for (let i = 0; i < nums.length; i++) { for (let i = 0; i < nums.length; i++) {
if (m[nums[i]] !== undefined) { if (m[target - nums[i]] !== undefined) {
return [m[nums[i]], i]; return [m[target-nums[i]], i];
} else { } else {
m[target - nums[i]] = i; m[nums[i]] = i;
} }
} }
return []; return [];

4
codes/typescript/chapter_searching/two_sum.ts
View File

@ -24,11 +24,11 @@ function twoSumHashTable(nums: number[], target: number): number[] {
let m: Map<number, number> = new Map(); let m: Map<number, number> = new Map();
// 单层循环，时间复杂度 O(n) // 单层循环，时间复杂度 O(n)
for (let i = 0; i < nums.length; i++) { for (let i = 0; i < nums.length; i++) {
let index = m.get(nums[i]); let index = m.get(target - nums[i]);
if (index !== undefined) { if (index !== undefined) {
return [index, i]; return [index, i];
} else { } else {
m.set(target - nums[i], i); m.set(nums[i], i);
} }
} }
return []; return [];