给定一个包含 n 个整数的数组 nums 和一个目标值 target,判断 nums 中是否存在四个元素 a,b,c 和 d ,使得 a + b + c + d 的值与 target 相等?找出所有满足条件且不重复的四元组。
注意:
答案中不可以包含重复的四元组。
示例:
给定数组 nums = [1, 0, -1, 0, -2, 2],和 target = 0。
满足要求的四元组集合为:
[
[-1, 0, 0, 1],
[-2, -1, 1, 2],
[-2, 0, 0, 2]
]
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/4sum
解法一:排序+双指针
class Solution:
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
if len(nums)<4:
return []
result = []
nums.sort() # -2 -1 0 0 1 2
for i in range(len(nums)-3):
if i >0 and nums[i] == nums[i-1]:
continue
for j in range(i+1,len(nums)-2):
if j-i>1 and nums[j] == nums[j-1]:
continue
l = j+1
r = len(nums)-1
while l < r:
sum = nums[i] + nums[j] + nums[l] + nums[r]
if sum == target:
result.append([nums[i], nums[j], nums[l], nums[r]])
while l < r and nums[l] == nums[l + 1]:
l = l + 1
while l < r and nums[r] == nums[r - 1]:
r = r - 1
l = l + 1
r = r - 1
elif sum>target:
r = r-1
else:
l = l+1
return result
解法二:剪枝优化
class Solution:
def fourSum(self, nums,target):
if len(nums)<4:
return []
result = []
nums.sort() # -4 -1 -1 0 1 2
for i in range(len(nums)-3):
if i >0 and nums[i] == nums[i-1]:
continue
if nums[i]+nums[i+1]+nums[i+2]+nums[i+3]>target:
break
if nums[i]+nums[-1]+nums[-2]+nums[-3]<target:
continue
for j in range(i+1,len(nums)-2):
if j-i>1 and nums[j] == nums[j-1]:
continue
if nums[j] + nums[i] + nums[j + 1] + nums[j + 2] > target:
break
if nums[j] + nums[i] + nums[-1] + nums[-2] < target:
continue
l = j+1
r = len(nums)-1
while l < r:
sum = nums[i] + nums[j] + nums[l] + nums[r]
if sum == target:
result.append([nums[i], nums[j], nums[l], nums[r]])
while l < r and nums[l] == nums[l + 1]:
l = l + 1
while l < r and nums[r] == nums[r - 1]:
r = r - 1
l = l + 1
r = r - 1
elif sum>target:
r = r-1
else:
l = l+1
return result