forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdoh6077.py
More file actions
42 lines (31 loc) · 1.14 KB
/
doh6077.py
File metadata and controls
42 lines (31 loc) · 1.14 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
from typing import List
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
nums.sort()
n = len(nums)
res: List[List[int]] = []
for i in range(n - 2):
# i 중복 스킵
if i > 0 and nums[i] == nums[i - 1]:
continue
# nums[i] 이후는 전부 양수 → 더 이상 0 못 만듦
if nums[i] > 0:
break
left, right = i + 1, n - 1
while left < right:
total = nums[i] + nums[left] + nums[right]
if total == 0:
res.append([nums[i], nums[left], nums[right]])
left += 1
right -= 1
# left 중복 스킵
while left < right and nums[left] == nums[left - 1]:
left += 1
# right 중복 스킵
while left < right and nums[right] == nums[right + 1]:
right -= 1
elif total < 0:
left += 1
else:
right -= 1
return res