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

Update js code format

Browse Source
This commit is contained in:
gyt95 2022-12-15 23:50:08 +08:00
parent 94d5de6096
commit 76693ab0fb
1 changed files with 10 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
docs/chapter_computational_complexity/space_time_tradeoff.md
View File

@ -91,15 +91,15 @@ comments: true
```js title="leetcode_two_sum.js" ```js title="leetcode_two_sum.js"
function twoSumBruteForce(nums, target) { function twoSumBruteForce(nums, target) {
let n = nums.length; let n = nums.length;
// 两层循环，时间复杂度 O(n^2) // 两层循环，时间复杂度 O(n^2)
for (let i = 0; i < n; i++) { for (let i = 0; i < n; i++) {
for (let j = i + 1; j < n; j++) { for (let j = i + 1; j < n; j++) {
if (nums[i] + nums[j] === target) { if (nums[i] + nums[j] === target) {
return [i, j] return [i, j];
} }
}
} }
}
} }
``` ```
@ -205,11 +205,11 @@ comments: true
```js title="leetcode_two_sum.js" ```js title="leetcode_two_sum.js"
function twoSumHashTable(nums, target) { function twoSumHashTable(nums, target) {
// 辅助哈希表，空间复杂度 O(n) // 辅助哈希表，空间复杂度 O(n)
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[nums[i]] !== undefined) {
return [m[nums[i]], i] return [m[nums[i]], i];
} else { } else {
m[target - nums[i]] = i; m[target - nums[i]] = i;
} }