-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy path1__easy__two-sum.js
More file actions
47 lines (35 loc) · 864 Bytes
/
1__easy__two-sum.js
File metadata and controls
47 lines (35 loc) · 864 Bytes
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
44
45
46
47
/*
Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
Example:
Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
*/
/**
* @param
* @return
*/
/**
*
* O(n) time
* O(n) space
*
* 5m
*/
var twoSum = function (nums, target) {
let map = {};
for (let i = 0; i < nums.length; i++) {
if (map[nums[i]] !== undefined) return [map[nums[i]], i];
map[target - nums[i]] = i;
}
return false
};
var twoSum = function (nums, target) {
let map = new Map();
for (let i = 0; i < nums.length; i++) {
if (map.has(nums[i])) return [map.get(nums[i]), i];
map.set(target - nums[i], i);
}
return false
};