-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsolution.py
33 lines (27 loc) · 997 Bytes
/
solution.py
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
from typing import List
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
res = []
nums.sort()
for i, num in enumerate(nums):
if i > 0 and num == nums[i - 1]:
continue
left, right = i + 1, len(nums) - 1
while left < right:
threeSum = num + nums[left] + nums[right]
if threeSum > 0:
right -= 1
elif threeSum < 0:
left += 1
else:
res.append([num, nums[left], nums[right]])
left += 1
right -= 1
while nums[left] == nums[left - 1] and left < right:
left += 1
while nums[right] == nums[right + 1] and left < right:
right -= 1
return res
if __name__ == '__main__':
nums = [-1, 0, 1, 2, -1, -4]
print(Solution().threeSum(nums))