-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSolution.py
More file actions
37 lines (33 loc) · 1.56 KB
/
Copy pathSolution.py
File metadata and controls
37 lines (33 loc) · 1.56 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
from _ast import List
class Solution:
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
ans = []
if nums is not None and len(nums) >= 4:
length = len(nums)
nums = sorted(nums)
for i in range(length - 3):
if i > 0 and nums[i] == nums[i - 1]:
continue
for j in range(i + 1, length - 2):
if j > i + 1 and nums[j] == nums[j - 1]:
continue
left, right = j + 1, length - 1
while left < right:
if nums[i] + nums[j] + nums[left] + nums[right] == target:
oneAns = [nums[i], nums[j], nums[left], nums[right]]
ans.append(oneAns)
left += 1
right -= 1
while left < right and nums[left] == nums[left - 1]:
left += 1
while left < right and nums[right] == nums[right + 1]:
right -= 1
elif nums[i] + nums[j] + nums[left] + nums[right] < target:
left += 1
while left < right and nums[left] == nums[left - 1]:
left += 1
else:
right -= 1
while left < right and nums[right] == nums[right + 1]:
right -= 1
return ans