-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy path4sum.cpp
53 lines (48 loc) · 1.8 KB
/
4sum.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
class Solution {
public:
vector<vector<int>> fourSum(vector<int>& nums, int target) {
map <int, vector <pair<int,int>>> mp;
vector<vector<int>> result;
if(nums.size()<1)
return result;
for(int i=0; i<nums.size()-1;i++)
{
for(int j=i+1; j<nums.size();j++)
{
pair <int,int> p = make_pair(i,j);
mp[nums[i] + nums[j]].push_back(p);
}
}
for(int i=0; i<nums.size()-1;i++)
{
for(int j=i+1; j<nums.size();j++)
{
int sum = nums[i] + nums[j];
if (mp.find(target - sum) != mp.end())
{
auto num = mp.find(target - sum);
vector<pair<int, int> > v = num->second;
for (int k = 0; k < num->second.size(); k++)
{
vector <int> curr;
pair<int, int> it = v[k];
if (it.first != i && it.first != j &&
it.second != i && it.second != j)
{
curr.push_back(nums[i]);
curr.push_back(nums[j]);
curr.push_back(nums[it.first]);
curr.push_back(nums[it.second]);
sort(curr.begin(),curr.end());
}
if(curr.size()>0)
result.push_back(curr);
}
}
}
}
sort( result.begin(), result.end() );
result.erase( unique( result.begin(), result.end() ), result.end() );
return result;
}
};