-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmain.py
40 lines (38 loc) · 1.12 KB
/
main.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
class Solution(object):
def threeSum(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
res = []
nums = sorted(nums)
i = 0
while i < len(nums) - 2:
if i > 0 and nums[i] == nums[i - 1]:
i += 1
continue
l = i + 1
r = len(nums) - 1
while l < r:
s = nums[i] + nums[l] + nums[r]
if s == 0:
res.append([nums[i], nums[l], nums[r]])
l += 1
r -= 1
while l < len(nums) and nums[l] == nums[l - 1]:
l += 1
while r >= 0 and nums[r] == nums[r + 1]:
r -= 1
elif s < 0:
l += 1
elif s > 0:
r -= 1
i += 1
return res
import os
if os.getenv('LZS'):
s = Solution()
print(s.threeSum([-1, 0, 1, 2, -1, -4]))
print(s.threeSum([-3, 4, 4, 8, -4, -4, 1, 2]))
print(s.threeSum([0, 0, 0]))
print(s.threeSum([0, 0]))