forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathBlossssom.ts
More file actions
49 lines (42 loc) ยท 1.17 KB
/
Blossssom.ts
File metadata and controls
49 lines (42 loc) ยท 1.17 KB
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
/**
* @param nums - ์ ์ ๋ฐฐ์ด
* @returns - ์ธ ์์๋ฅผ ํฉํด 0์ด ๋๋ ๊ฐ์ ๋ฐฐ์ด
* @description
* - ํฌ ํฌ์ธํฐ ๋ฐฉ์
* - ๊ฒฐ๊ตญ ์ ๋ํฌํ ์กฐํฉ์ ์ฐพ์ผ๋ฉฐ ์ค๋ณต์ ์ ์ธํ๋ ๋ฐฉํฅ
* - ๋ฌด์กฐ๊ฑด ์ ์ธ ๋ฐ๋ณต ์ค์ด๊ธฐ๊ฐ ์๋ ํจ์จ์ ๋ฒ์ ๋ฐ๋ณต์ ํ์ตํด์ผํจ
* - ์๊ฐ ๋ณต์ก๋ O(N^2)
* - ๊ณต๊ฐ ๋ณต์ก๋ O(log N)
*/
function threeSum(nums: number[]): number[][] {
const answer: number[][] = [];
nums.sort((a, b) => a - b);
for (let i = 0; i < nums.length - 2; i++) {
if (i && nums[i] === nums[i - 1]) {
continue;
}
let left = i + 1;
let right = nums.length - 1;
while (left < right) {
const sum = nums[i] + nums[left] + nums[right];
if (sum === 0) {
answer.push([nums[i], nums[left], nums[right]]);
while (left < right && nums[left] === nums[left + 1]) {
left++;
}
while (left < right && nums[right] === nums[right - 1]) {
right--;
}
left++;
right--;
} else if (sum < 0) {
left++;
} else {
right--;
}
}
}
return answer;
}
const nums = [-1, 0, 1, 2, -1, -4];
threeSum(nums);