-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path15. 3Sum.py
34 lines (32 loc) · 979 Bytes
/
15. 3Sum.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
34
class Solution(object):
def threeSum(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
ans = []
if not nums or len(nums) < 3:
return ans
nums.sort()
for i in range(len(nums)):
if nums[i] > 0:
break
if i > 0 and nums[i - 1] == nums[i]:
continue
l = i + 1
r = len(nums) - 1
while l < r:
sum_ = nums[i] + nums[l] + nums[r]
if sum_ == 0:
ans.append((nums[i], nums[l], nums[r]))
while l < r and nums[l] == nums[l + 1]:
l += 1
while l < r and nums[r] == nums[r - 1]:
r -= 1
l += 1
r -= 1
elif sum_ > 0:
r -= 1
else:
l += 1
return ans