-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtemp3sum.py
More file actions
60 lines (40 loc) · 1.27 KB
/
temp3sum.py
File metadata and controls
60 lines (40 loc) · 1.27 KB
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
class Solution(object):
def threeSum(self, nums):
"""
:type nums: List[int]
:rtype: List[List[int]]
"""
if not nums or len(nums) == 0:
return []
if len(nums) < 3:
return []
if len(nums) == 3:
if (nums[0] + nums[1] + nums[2] == 0):
return [nums]
else :
return []
resList = []
# tempNums = nums
nums.sort()
for i in range(len(nums)):
l, r = i + 1, len(nums) - 1
## Because we've already considered it
if i > 0 and nums[i] == nums[i - 1]:
continue
while l < r:
print(nums[i], nums[l], nums[r])
currSum = nums[i] + nums[l] + nums[r]
if currSum == 0:
resList.append([nums[i], nums[l], nums[r]])
l += 1
while l < len(nums) - 1 and nums[l] == nums[l-1]:
l += 1
if currSum > 0:
r -= 1
if currSum < 0:
l += 1
# print(resList)
return resList
temp = Solution()
# print(temp.threeSum([-1,-3,-4, 4, 0, 1]))
print(temp.threeSum([-1,0,1,0]))