-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path153Sum.py
38 lines (34 loc) · 1.14 KB
/
153Sum.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
35
36
37
#17
class Solution(object):
def threeSum(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
nums.sort()
ans = []
for i in range(len(nums) - 2):
if i > 0 and nums[i] == nums[i - 1]:
continue
left = i + 1
right = len(nums) - 1
while left < right:
sss = nums[left] + nums[right] + nums[i]
if sss == 0:
ans.append([nums[i], nums[left], nums[right]])
left += 1
while left < len(nums) and nums[left] == nums[left - 1]:
left += 1
right -= 1
while right > 0 and nums[right] == nums[right + 1]:
right -= 1
continue
if sss < 0:
left += 1
while nums[left] == nums[left - 1]:
left += 1
else:
right -= 1
while nums[right] == nums[right + 1]:
right -= 1
return ans