-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path015_3Sum.py
36 lines (34 loc) · 1 KB
/
015_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
35
36
# Author: cym
class Solution(object):
def threeSum(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
nums.sort()
ans = []
if len(nums) < 3:
return ans
t = 0
while t < len(nums) and nums[t] <= 0:
t += 1
for i in range(t):
if i > 0 and nums[i-1] == nums[i]:
continue
j = i+1
k = len(nums)-1
while j < k:
s = nums[j] + nums[k]
if s == -nums[i]:
ans.append([nums[i], nums[j], nums[k]])
while j+1 < k and nums[j+1] == nums[j]:
j += 1
while k-1 > j and nums[k-1] == nums[k]:
k -= 1
j += 1
k -= 1
elif s > -nums[i]:
k -= 1
else:
j += 1
return ans