给你一个由 n 个整数组成的数组 nums ,和一个目标值 target 。请你找出并返回满足下述全部条件且不重复的四元组 [nums[a], nums[b], nums[c], nums[d]] (若两个四元组元素一一对应,则认为两个四元组重复):
0 <= a, b, c, d < n
a、b、c 和 d 互不相同
nums[a] + nums[b] + nums[c] + nums[d] == target
你可以按 任意顺序 返回答案 。
示例 1:
输入:nums = [1,0,-1,0,-2,2], target = 0
输出:[[-2,-1,1,2],[-2,0,0,2],[-1,0,0,1]]
示例 2:
输入:nums = [2,2,2,2,2], target = 8
输出:[[2,2,2,2]]
解法:(排序双指针)
class Solution:
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
nums.sort()
n = len(nums)
res = []
for i in range(n-3):
if nums[i] == nums[i-1] and i != 0:
continue
for j in range(i+1, n-2):
if j != i+1 and nums[j] == nums[j-1]:continue
left = j+1
right = n-1
while left < right:
s = nums[i] + nums[j] + nums[left] + nums[right]
if s == target and [nums[i], nums[j], nums[left], nums[right]] not in res:
res.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 s > target:
right -= 1
else:
left += 1
return res