-
Notifications
You must be signed in to change notification settings - Fork 0
/
script.js
47 lines (40 loc) · 900 Bytes
/
script.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
/**
* @param {number[]} nums
* @param {number} target
* @return {number[]}
*/
/**
*
* BRUTE FORCE SOLUTION
* This algorithm can take a LONG time, Big O notation, O(n)
*
*/
function twoSumBrute(nums, target) {
for (let i = 0; i < nums.length; i++) {
for (let j = i + 1; j < nums.length; j++) {
if (nums[i] + nums[j] === target) {
return [i, j]
}
}
}
};
// console.log(twoSumBrute([2, 7, 11, 15], 18));
/**
*
* It requires more memory
* It’s a bit harder to conceptualize
* Extra caching and a little logic
*
*/
const twoSum = function (nums, target) {
let obj = {};
for (let i = 0; i < nums.length; i++) {
let n = nums[i]
if (obj[target - n] >= 0) {
return [obj[target - n], i]
} else {
obj[n] = i;
}
}
}
console.log(twoSum([1,2,3,4], 7));