-
Notifications
You must be signed in to change notification settings - Fork 28
/
Copy pathsolution.py
33 lines (26 loc) · 985 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]]:
nums.sort()
output_list = []
for i in range(len(nums)):
if nums[i] > 0:
break
if i > 0 and nums[i] == nums[i - 1]:
continue
target = -nums[i]
left, right = i + 1, len(nums) - 1
while left < right:
total = nums[left] + nums[right]
if target == total:
output_list.append([nums[i], nums[left], nums[right]])
left += 1
while left < right and nums[left] == nums[left - 1]:
left += 1
while left < right and nums[right] == nums[right - 1]:
right -= 1
elif target < total:
right -= 1
else:
left += 1
return output_list