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:
- Elements in a quadruplet (a,b,c,d) must be in non-descending order. (ie, a ≤ b ≤ c ≤ d)
- 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)和3 Sum基本一样,只是多加了一个循环。
vector<vector<int> > fourSum(vector<int> &num, int target)
{
vector<vector<int> > ans;
int len= num.size();
sort(num.begin(), num.end());
for (int a = 0; a < len; ++a)
{
if (a > 0 && num[a] == num[a - 1])
continue;
for (int b = a + 1; b < len; ++b)
{
if (b > a + 1 && num[b] == num[b - 1])
continue;
int c = b + 1;
int d = len - 1;
while (c < d)
{
if(c > b+1 && num[c]==num[c-1])
{
c++;
continue;
}
if(d < len-1 && num[d]==num[d+1])
{
d--;
continue;
}
int sum = num[a] + num[b] + num[c] + num[d];
if (sum == target)
{
vector<int> tmp;
tmp.push_back(num[a]);
tmp.push_back(num[b]);
tmp.push_back(num[c]);
tmp.push_back(num[d]);
ans.push_back(tmp);
c++;
}
else if(sum > target)
d--;
else
c++;
}
}
}
return ans;
}