mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-25 13:56:28 +08:00
e720aa2d24
* Sync recent changes to the revised Word. * Revised the preface chapter * Revised the introduction chapter * Revised the computation complexity chapter * Revised the chapter data structure * Revised the chapter array and linked list * Revised the chapter stack and queue * Revised the chapter hashing * Revised the chapter tree * Revised the chapter heap * Revised the chapter graph * Revised the chapter searching * Reivised the sorting chapter * Revised the divide and conquer chapter * Revised the chapter backtacking * Revised the DP chapter * Revised the greedy chapter * Revised the appendix chapter * Revised the preface chapter doubly * Revised the figures
46 lines
1.1 KiB
JavaScript
46 lines
1.1 KiB
JavaScript
/**
|
|
* File: two_sum.js
|
|
* Created Time: 2022-12-15
|
|
* Author: gyt95 (gytkwan@gmail.com)
|
|
*/
|
|
|
|
/* 方法一：暴力枚举 */
|
|
function twoSumBruteForce(nums, target) {
|
|
const 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];
|
|
}
|
|
}
|
|
}
|
|
return [];
|
|
}
|
|
|
|
/* 方法二：辅助哈希表 */
|
|
function twoSumHashTable(nums, target) {
|
|
// 辅助哈希表，空间复杂度为 O(n)
|
|
let m = {};
|
|
// 单层循环，时间复杂度为 O(n)
|
|
for (let i = 0; i < nums.length; i++) {
|
|
if (m[target - nums[i]] !== undefined) {
|
|
return [m[target - nums[i]], i];
|
|
} else {
|
|
m[nums[i]] = i;
|
|
}
|
|
}
|
|
return [];
|
|
}
|
|
|
|
/* Driver Code */
|
|
// 方法一
|
|
const nums = [2, 7, 11, 15],
|
|
target = 13;
|
|
|
|
let res = twoSumBruteForce(nums, target);
|
|
console.log('方法一 res = ', res);
|
|
|
|
// 方法二
|
|
res = twoSumHashTable(nums, target);
|
|
console.log('方法二 res = ', res);
|