-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmain.js
46 lines (45 loc) · 1.07 KB
/
main.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
/**
* @param {number[]} nums
* @return {number[][]}
*/
var threeSum = function (nums) {
function twoSum (start, end, sum) {
const ans = []
let lv = nums[0] - 1
let rv = nums[0] - 1
while (start < end) {
lv = nums[start]
rv = nums[end]
if (lv + rv === sum) {
ans.push([-sum, lv, rv])
while (start < end && nums[start] === lv && nums[end] === rv) {
start++
end--
}
} else if (lv + rv > sum) {
while (start < end && nums[end] === rv) {
end--
}
} else if (lv + rv < sum) {
while (start < end && nums[start] === lv) {
start++
}
}
}
return ans
}
let ans = []
nums.sort((x, y) => x < y ? -1 : 1)
nums.forEach((item, index) => {
if (index > 0 && nums[index - 1] === item) {
return
}
const twos = twoSum(index + 1, nums.length - 1, -item)
if (twos.length) {
ans = ans.concat(twos)
}
})
return ans
}
console.log(threeSum([-1, 0, 1, 2, -1, -4]))
console.log(threeSum([-3, 4, 4, 8, -4, -4, 1, 2]))