-
Notifications
You must be signed in to change notification settings - Fork 22
/
Copy pathtwoSum.js
69 lines (56 loc) · 1.24 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
57
58
59
60
61
62
63
64
65
66
67
68
/**
* 二数之和
*/
export function twoSum1(arr, target) {
if (typeof target !== 'number') {
throw new Error('target must be a number');
}
if (!Array.isArray(arr)) {
throw new Error('arr must be an array');
}
if (arr.length < 2) {
throw new Error('arr length must max or equal two');
}
const set = new Set(arr);
let index1;
let index2;
for (let i = 0; i < arr.length; i++) {
const number1 = arr[i];
const number2 = target - number1;
if (set.has(number2)) {
const index = arr.indexOf(number2);
if (i === index) {
continue;
}
index1 = i;
index2 = index;
break;
}
}
if (index1 === undefined) {
return [];
}
return [index1, index2];
}
export function twoSum2(arr, target) {
if (typeof target !== 'number') {
throw new Error('target must be a number');
}
if (!Array.isArray(arr)) {
throw new Error('arr must be an array');
}
if (arr.length < 2) {
throw new Error('arr length must max or equal two');
}
const data = {};
for (let i = 0; i < arr.length; i++) {
const num = arr[i];
if (data[target - num] !== undefined) {
return [data[target - num], i];
}
else {
data[num] = i;
}
}
return [];
}