# 【Leetcode】4Sum

Given an array S of n integers, are there elements abc, 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)


class Solution {
public:
vector<vector<int> > fourSum(vector<int> &num, int target) {
// Note: The Solution object is instantiated only once and is reused by each test case.
vector<vector<int>> res;
vector<int> temp;
if(num.size()<4)
return res;
sort(num.begin(),num.end());
int len=num.size();
set<vector<int>> tmpres;
for(int i=0;i<len;i++)
{
for(int j=i+1;j<len;j++)
{
int start=j+1;
int end=len-1;
while(start<end)
{
int sum=num[i]+num[j]+num[start]+num[end];
if(sum==target)
{
vector<int> temp;
temp.push_back(num[i]);
temp.push_back(num[j]);
temp.push_back(num[start]);
temp.push_back(num[end]);
tmpres.insert(temp);
start++;
end--;
}
else if(sum<target)
start++;
else
end--;
}
}
}
set<vector<int>>::iterator it = tmpres.begin();
for(; it != tmpres.end(); it++)
res.push_back(*it);
return res;
}
};

举报原因： 您举报文章：【Leetcode】4Sum 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)