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 js code and docs

Browse Source
This commit is contained in:
gyt95 2022-12-16 16:27:13 +08:00
parent c8da48c0d6
commit dc985cb962
2 changed files with 13 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
codes/javascript/chapter_computational_complexity/leetcode_two_sum.js
View File

@ -5,7 +5,7 @@
*/
function twoSumBruteForce(nums, target) {
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++) {
@ -14,6 +14,7 @@ function twoSumBruteForce(nums, target) {
}
}
}
return [];
}
function twoSumHashTable(nums, target) {
@ -27,13 +28,15 @@ function twoSumHashTable(nums, target) {
m[target - nums[i]] = i;
}
}
return [];
}
/* 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 res = twoSumBruteForce(nums, target)
console.log("方法一 res = ", res)
let nums1 = [2, 7, 11, 15], target1 = 9;
twoSumHashTable(nums1, target1)
console.log("使用辅助哈希表后得到结果", nums1)
// 方法二
res = twoSumHashTable(nums, target)
console.log("方法二 res = ", res)

4
docs/chapter_computational_complexity/space_time_tradeoff.md
View File

@ -91,7 +91,7 @@ comments: true
```js title="leetcode_two_sum.js"
function twoSumBruteForce(nums, target) {
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++) {
@ -100,6 +100,7 @@ comments: true
}
}
}
return [];
}
```
@ -214,6 +215,7 @@ comments: true
m[target - nums[i]] = i;
}
}
return [];
}
```