-
Notifications
You must be signed in to change notification settings - Fork 181
/
21.two-sum.js
43 lines (30 loc) · 990 Bytes
/
21.two-sum.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
// https://leetcode-cn.com/problems/two-sum/
/**
*
给定一个整数数组 nums 和一个整数目标值 target,请你在该数组中找出 和为目标值 target 的那 两个 整数,并返回它们的数组下标。
你可以假设每种输入只会对应一个答案。但是,数组中同一个元素在答案里不能重复出现。
你可以按任意顺序返回答案。
示例 1:
输入:nums = [2,7,11,15], target = 9
输出:[0,1]
解释:因为 nums[0] + nums[1] == 9 ,返回 [0, 1] 。
示例 2:
输入:nums = [3,2,4], target = 6
输出:[1,2]
示例 3:
输入:nums = [3,3], target = 6
输出:[0,1]
*
*/
const twoSum = (nums, target) => {
const cacheMap = {}
for (let i = 0, len = nums.length; i < len; i++) {
const diff = target - nums[ i ]
if (cacheMap[ diff ] !== undefined) {
return [ cacheMap[ diff ], i ]
} else {
cacheMap[ nums[ i ] ] = i
}
}
}
console.log(twoSum([ 2, 7, 11, 15 ], 22))