-
Notifications
You must be signed in to change notification settings - Fork 0
/
twoSum.js
56 lines (52 loc) · 1.36 KB
/
twoSum.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
44
45
46
47
48
49
50
51
52
53
54
55
56
const twoSum = (nums, target) => {
const map = new Map()
let result = []
nums.map((v, i) => {
const complement = target - v
map.has(complement) ? result = [map.get(complement), i] : map.set(v, i)
})
return result
}
const twoSum = (nums, target) => {
const map = new Map()
for (let i = 0; i < nums.length; i++) {
const current = nums[i]
const complement = target - current
if (map.has(complement)) {
return [map.get(complement), i]
}
map.set(current, i)
}
return false
}
const twoSum = (nums, target) => {
const map = {}
let result = []
nums.map((v, i) => {
const complement = target - v
complement in map ? result = [map[complement], i] : map[v] = i
})
return result
}
const twoSum = (nums, target) => {
let sums = []
let result = []
nums.map((v, i) => {
const complement = target - v
sums.includes(complement) ? result = [sums.indexOf(complement), i] : sums.push(v)
})
return result
}
/* Fastest solution */
const twoSum = (nums, target) => {
const map = {}
for (let i = 0; i < nums.length; i ++) {
const current = nums[i]
const complement = target - current
if (complement in map) {
return [map[complement], i]
}
map[current] = i
}
return false
}