forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution.js
32 lines (32 loc) · 957 Bytes
/
Solution.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
/**
* @param {number[]} nums
* @return {number[][]}
*/
var threeSum = function (nums) {
let len = nums.length;
if (len < 3) return [];
let res = [];
nums.sort((a, b) => a - b);
for (let i = 0; i < len - 2; i++) {
if (nums[i] > 0) break;
if (i > 0 && nums[i] === nums[i - 1]) continue;
let left = i + 1, right = len - 1;
while (left < right) {
if (nums[i] + nums[left] + nums[right] === 0) {
res.push([nums[i], nums[left], nums[right]]);
while (nums[left] === nums[left + 1]) left++;
left++;
while (nums[right] === nums[right - 1]) right--;
right--;
continue;
} else if (nums[i] + nums[left] + nums[right] > 0) {
right--;
continue;
} else {
left++;
continue;
}
}
}
return res;
};