方法一:排序+双指针
思想:与三数之和相同
class Solution:
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
n = len(nums)
ret = list()
if n < 4:#如果数组长度小于4个,则没有四数之和
return ret
nums.sort() #对数组进行排序
l = len(nums)
for i in range(l - 3):
if i > 0 and nums[i] == nums[i - 1]: #去除i位置相同的元素
continue
if nums[i] + nums[i+1] + nums[i+2] + nums[i+3] > target:#左边的四位数之和大于target,表示右边的数之和始终大于target,不存在四树枝和等于target
break
if nums[i] + nums[l-1] + nums[l-2] + nums[l-3] < target:#表示第一个数为nums[i],与数组中最大的三个数之和都小于target,则数组中肯定不存在nums[i]
continue
for j in range(i + 1, l - 2):
if j > i + 1 and nums[j] == nums[j - 1]:
continue
if nums[i] + nums[j] + nums[j+1] + nums[i+2] > target:
break
if nums[i] + nums[j] + nums[l-1] + nums[l-2] < target:
continue
left = j + 1
right = l -1
while left < right:
sum1 = nums[i] + nums[j] + nums[left] + nums[right]
if sum1 == target:
ret.append([nums[i], nums[j], nums[left], nums[right]])
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 sum1 < target:
left += 1
else:
right -= 1
return ret