解题思路:排序后固定前两个值,去查看后面的序列中有无满足target-cursum的答案,用map(unorder_map)来标识前两个值唯一,代码性能不太行,代码如下:
class Solution {
public:
map<pair<int,int>,int> mp;
vector<vector<int> > res;
void append(int &x,int &y)
{
mp[make_pair(x,y)]=1;//把该前缀加入mp
}
int releft(int &left,vector<int>& nums)//从当前位置找到第一个不和左边值相同的left
{
int p = nums.size()-1;
for(int i=left+1;i<nums.size();i++)
{
if(nums[i]!=nums[left]||i==nums.size()-1)
{
p=i;
break;
}
}
return p;
}
int reright(int &right,vector<int>& nums)
{
int p = 0;
for(int i=right-1;i>=0;i--)
{
if(nums[i]!=nums[right]||i==0)
{
p=i;
break;
}
}
return p;
}
void fun(int i,int j,int k,long long sum,vector<int>& nums)
{
int left = k;
int right = nums.size()-1;
while(left<right)
{
long long cur = nums[left]+nums[right];
if(cur==sum)
{
vector<int> temp={nums[i],nums[j],nums[left],nums[right]};
res.push_back(temp);
left = releft(left,nums);
right = reright(right,nums);
}
else if(cur<sum)
{
left = releft(left,nums);
}
else
{
right = reright(right,nums);
}
}
}
vector<vector<int>> fourSum(vector<int>& nums, int target) {
int n = nums.size();
if(n<4)
{
return res;
}
sort(nums.begin(),nums.end());
if((target>0&&nums[0]>target)||(target<0&&nums[n-1]<target))
{
return res;
}
long long cursum=0;
for(int i=0;i<n;i++)
{
for(int j=i+1;j<n;j++)
{
if(mp[make_pair(nums[i],nums[j])]) continue;
cursum=nums[i]+nums[j];
fun(i,j,j+1,target-cursum,nums);
append(nums[i],nums[j]);
}
}
return res;
}
};