-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathfourSum.py
More file actions
39 lines (30 loc) · 1.1 KB
/
fourSum.py
File metadata and controls
39 lines (30 loc) · 1.1 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
class Solution:
def four_sum(self, nums, target):
nums.sort()
result = []
i = 0
while i < len(nums) - 3:
print(len(nums) - 3)
#is that 0,1,2??
j = i + 1
while j < len(nums) - 2:
print(len(nums) - 2)
left, right = j + 1, len(nums) - 1
while left < right:
current_sum = nums[i] + nums[j] + nums[left] + nums[right]
if current_sum == target:
quad = [nums[i], nums[j], nums[left], nums[right]]
result.append(quad)
print(f"{quad} = {current_sum}")
left += 1
right -= 1
elif current_sum < target:
left += 1
else:
right -= 1
j += 1
i += 1
return result
myVar = Solution()
myVar.four_sum([1,0,-1,0,-2,2], 0)
#solution [[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]