mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-25 13:56:28 +08:00
update code style for js
This commit is contained in:
parent
3a01f21dca
commit
5694c8e8ff
1 changed files with 18 additions and 18 deletions
|
@ -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
|
||||
*/
|
||||
|
||||
/**
|
||||
|
@ -16,7 +16,7 @@ function twoSumBruteForce(nums, target) {
|
|||
for (let i = 0; i < n; i++) {
|
||||
for (let j = i + 1; j < n; j++) {
|
||||
if (nums[i] + nums[j] === target) {
|
||||
return [i, j]
|
||||
return [i, j];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
@ -24,11 +24,11 @@ function twoSumBruteForce(nums, target) {
|
|||
|
||||
function twoSumHashTable(nums, target) {
|
||||
// 辅助哈希表,空间复杂度 O(n)
|
||||
let m = {}
|
||||
let m = {};
|
||||
// 单层循环,时间复杂度 O(n)
|
||||
for (let i = 0; i < nums.length; i++) {
|
||||
if (m[nums[i]] !== undefined) {
|
||||
return [m[nums[i]], i]
|
||||
return [m[nums[i]], i];
|
||||
} else {
|
||||
m[target - nums[i]] = i;
|
||||
}
|
||||
|
|
Loading…
Reference in a new issue