-
Notifications
You must be signed in to change notification settings - Fork 0
/
015ThreeSum.py
65 lines (62 loc) · 1.95 KB
/
015ThreeSum.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
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
class Solution(object):
def threeSum(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
nums.sort()
N, result = len(nums), []
for i in range(N):
if i > 0 and nums[i] == nums[i-1]:
continue
target = nums[i]*-1
s,e = i+1, N-1
while s<e:
if nums[s]+nums[e] == target:
result.append([nums[i], nums[s], nums[e]])
s = s+1
while s<e and nums[s] == nums[s-1]:
s = s+1
while s<e and nums[e-1]==nums[e]:
e=e-1
elif nums[s] + nums[e] < target:
s = s+1
else:
e = e-1
return result
# if len(nums)<3:
# return []
# nums.sort()
# res=[]
# for i, v in enumerate(nums[:-2]):
# if i>0 and nums[i-1]==v:
# continue
# l, r= i+1, len(nums)-1
# while l<r:
# s= v+nums[l]+nums[r]
# if s>0:
# r-=1
# elif s<0:
# l+=1
# else:
# res.append((v, 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
# return res
# if len(nums)<3:
# return []
# nums.sort()
# res = set()
# for i,v in enumerate(nums[:-2]):
# if i>=1 and v==nums[i-1]:
# continue
# d={}
# for x in nums[i+1:]:
# if x not in d:
# d[-v-x]=1
# else:
# res.add((v, -v-x, x))
# return map(list, res)