4个数的和等于固定值,利用3个数的和等于固定值的API
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.
Note: The solution set must not contain duplicate quadruplets.
For example, given array S = [1, 0, -1, 0, -2, 2], and target = 0.
A solution set is:
[ [-1, 0, 0, 1],
[-2, -1, 1, 2],
[-2, 0, 0, 2] ]
代码实现
public class Solution {
public IList<IList<int>> FourSum(int[] nums, int target)
{
if(nums.Length<4) return new List<IList<int>>();
Array.Sort(nums); //sort nums
var rtn = new List<IList<int>>();
for (int i = 0; i < nums.Length - 3; i++)
{
while (i > 0 && i < nums.Length - 3 && nums[i] == nums[i - 1])
i++; //duplicate check
IList<IList<int>> thds = threeSum(nums,nums[i], i+1, target - nums[i]);
rtn.AddRange(thds);
}
return rtn;
}
private IList<IList<int>> threeSum(int[] nums, int which, int begin, int target)
{
IList<IList<int>> rtn = new List<IList<int>>();
for (int i = begin; i < nums.Length - 2; i++)
{
while (i > begin && i < nums.Length - 2 && nums[i] == nums[i - 1])
i++; //duplicate check
int lo = i + 1, hi = nums.Length - 1;
int partsum = target - nums[i];
while (lo < hi)
{
if (nums[lo] + nums[hi] == partsum)
{
rtn.Add(new List<int> { which,nums[i], nums[lo], nums[hi] });
//considering this condition: [-3,0,1,1,1,1,2,2,2,2]
while (lo < hi && nums[lo] == nums[lo + 1])
lo++;
while (lo < hi && nums[hi] == nums[hi - 1])
hi--;
lo++; hi--;
}
else if (nums[lo] + nums[hi] < partsum)
lo++;
else
hi--;
}
}
return rtn;
}
}
结果:
题库
Leetcode算法题目解决方案每天更新在github库中,欢迎感兴趣的朋友加入进来,也欢迎star,或pull request。https://github.com/jackzhenguo/leetcode-csharp