iven 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)
解析:
先进行排序。
如果采用3Sum的办法,排序后进行二分查找,需要固定前3个值。复杂度(N^3*logN)。
如果将其中两个值的和缓存下来,那么就回到查找3个数的和一样的问题。
限制条件:
1、注意4个值取值顺序,以及不应该出现相互覆盖。
2、注意num本身有重复值,需要去重操作。
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<utility>
using namespace std;
class Solution{
public:
vector<vector<int> > fourSum(vector<int> &num,int target)
{
vector<vector<int> > result;
int nSize=num.size();
if(nSize<4)return result;
sort(num.begin(),num.end());
//先计算两个任意两个数的和
map<int,vector<pair<int,int> > > cache;
for(int i=0;i<nSize;++i)
for(int j=i+1;j<nSize;++j){
cache[num[i]+num[j]].push_back(make_pair(i,j));
}
set<vector<int> > ret; //去重
for(int i=2;i<nSize-1;++i)
for(int j=i+1;j<nSize;++j)
{
const int key=target-num[i]-num[j];
if(cache.find(key)!=cache.end())
{
for(int h=0;h<cache[key].size();++h)
{
if(cache[key][h].second >= i) continue; //有重叠
vector<int> temp;
temp.push_back(num[cache[key][h].first]);
temp.push_back(num[cache[key][h].second]);
temp.push_back(num[i]);
temp.push_back(num[j]);
ret.insert(temp);
}
}
}
return vector<vector<int> > (ret.begin(),ret.end());
}
};
学习参考:LeetCode题解(https://gitcafe.com/soulmachine/LeetCode)
相关内容:
求和问题总结(leetcode 2Sum, 3Sum, 4Sum, K Sum) http://tech-wonderland.net/blog/summary-of-ksum-problems.html