【LeetNode2-1-10】Four sum--C++源代码(VS2015)

#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <vector>
using namespace std;

/*
Four sum
*/

vector<vector<int>> Solution(vector<int> &vec,const int target)
{
vector<vector<int>> result;
if (vec.size() < 4)
return result;

unordered_multimap<int, pair<int, int>> cache;
for(int i=0;i < vec.size() - 1; i++)
for (int j = i + 1; j < vec.size(); j++)
{
cache.insert(make_pair(vec[i] + vec[j], make_pair(i, j)));
}

for (auto i = cache.begin(); i != cache.end(); i++)
{
int sum = target - i->first;
auto range = cache.equal_range(sum);
for (auto j = range.first; j != range.second; j++)
{
auto a = i->second.first;
auto b = i->second.second;
auto c = j->second.first;
auto d = j->second.second;
if (a != c&&a != d&&b != c&&b != d)
{
vector<int> vec_temp = { vec[a],vec[b],vec[c],vec[d] };
sort(vec_temp.begin(),vec_temp.end());
result.push_back(vec_temp);
}
}
}
sort(result.begin(), result.end());
result.erase(unique(result.begin(), result.end()), result.end());
return result;
}

int main()
{
int arr[] = { 2,4,6,8,1,3,5,7 };
vector<int> vec(&arr[0], &arr[8]);
vector<vector<int>> result = Solution(vec,16);
for (int i = 0; i < result.size(); i++)
{
for (int j = 0; j < result[i].size(); j++)
{
cout << result[i][j] << " ";
}
cout << endl;
}
cout << endl;
system("pause");
return 0;
}