给你一个由 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]]
通用方法:排序+双指针
public IList<IList<int>> FourSum(int[] nums, int target) {
Array.Sort(nums);
int n = nums.Length;
IList<IList<int>> res = new List<IList<int>>();
if((target > 0 && nums[n -1] < 0) || (target < 0 && nums[0] > 0))
return res;
//先固定一个数
for (int first = 0; first < n - 3; first++)
{
//如果重复就跳过
if (first > 0 && nums[first] == nums[first - 1])
continue;
//再固定一个数
for(int second = first + 1; second < n - 2; second++)
{
if (second > first + 1 && nums[second] == nums[second - 1])
continue;
//防止溢出
long nowTarget = (long)target - (long)nums[first] - (long)nums[second];
int fourth = n - 1;
for (int third = second + 1; third < n - 1; third++)
{
if (third > second + 1 && nums[third] == nums[third - 1])
continue;
while (third < fourth && nums[third] + nums[fourth] > nowTarget)
fourth--;
if (third == fourth)
break;
if (nums[third] + nums[fourth] == nowTarget)
{
IList<int> temp = new List<int>();
temp.Add(nums[first]);
temp.Add(nums[second]);
temp.Add(nums[third]);
temp.Add(nums[fourth]);
res.Add(temp);
}
}
}
}
return res;
}