xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 01:26:29 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

update code style for js

Browse source
This commit is contained in:
gyt95 2022-12-15 23:41:06 +08:00
parent 3a01f21dca
commit 5694c8e8ff
1 changed files with 18 additions and 18 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

36
codes/javascript/chapter_computational_complexity/leetcode_two_sum.js
View file

@ -2,7 +2,7 @@
* @Author: gyt95 (gytkwan@gmail.com)
* @Date: 2022-12-15 10:51:54
* @Last Modified by: gyt95 (gytkwan@gmail.com)
* @Last Modified time: 2022-12-15 10:56:26
* @Last Modified time: 2022-12-15 23:40:09
*/
/**
@ -11,26 +11,26 @@
* @return {number[]}
*/
function twoSumBruteForce(nums, target) {
let n = nums.length;
// 两层循环，时间复杂度 O(n^2)
for (let i = 0; i < n; i++) {
for (let j = i + 1; j < n; j++) {
if (nums[i] + nums[j] === target) {
return [i, j]
}
let n = nums.length;
// 两层循环，时间复杂度 O(n^2)
for (let i = 0; i < n; i++) {
for (let j = i + 1; j < n; j++) {
if (nums[i] + nums[j] === target) {
return [i, j];
}
}
}
}
}
function twoSumHashTable(nums, target) {
// 辅助哈希表，空间复杂度 O(n)
let m = {}
// 单层循环，时间复杂度 O(n)
for (let i = 0; i < nums.length; i++) {
if (m[nums[i]] !== undefined) {
return [m[nums[i]], i]
} else {
m[target - nums[i]] = i;
// 辅助哈希表，空间复杂度 O(n)
let m = {};
// 单层循环，时间复杂度 O(n)
for (let i = 0; i < nums.length; i++) {
if (m[nums[i]] !== undefined) {
return [m[nums[i]], i];
} else {
m[target - nums[i]] = i;
}
}
}
}