forked from DaleStudy/leetcode-study
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhestia-park.py
More file actions
25 lines (21 loc) ยท 801 Bytes
/
hestia-park.py
File metadata and controls
25 lines (21 loc) ยท 801 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
nums.sort()
answer=set()
for i in range(len(nums)):
if nums[i] > 0:
break # ์ดํ ์ซ์๋ ๋ชจ๋ ์์ โ ํฉ์ด 0 ๋ถ๊ฐ๋ฅ
if i > 0 and nums[i] == nums[i - 1]:
continue
left, right = i + 1, len(nums) - 1
while left < right:
term = nums[i] + nums[left] + nums[right]
if term == 0:
answer.add((nums[i], nums[left], nums[right]))
left += 1
right -= 1
elif term < 0:
left += 1
else:
right -= 1
return [list(triplet) for triplet in answer]