forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtolluset.ts
56 lines (41 loc) Β· 1019 Bytes
/
tolluset.ts
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
/*
* TC: O(n^2)
* SC: O(n)
* */
function threeSum(nums: number[]): number[][] {
const n = nums.length;
const res: number[][] = [];
nums.sort((a, b) => a - b);
for (let i = 0; i < n - 2; i++) {
if (i > 0 && nums[i] === nums[i - 1]) {
continue;
}
let left = i + 1,
right = n - 1;
while (left < right) {
const sum = nums[i] + nums[left] + nums[right];
if (sum === 0) {
res.push([nums[i], nums[left], nums[right]]);
while (nums[left] === nums[left + 1]) {
left++;
}
while (nums[right] === nums[right - 1]) {
right++;
}
left++;
right--;
continue;
}
if (sum < 0) {
left++;
continue;
}
right--;
}
}
return res;
}
const tc1 = threeSum([-1, 0, 1, 2, -1, -4]); // [[-1,-1,2],[-1,0,1]]
console.info("π : tolluset.ts:39: tc1=", tc1);
const tc2 = threeSum([0, 0, 0]); // [[0,0,0]]
console.info("π : tolluset.ts:42: tc2=", tc2);