【LeetNode2-1-8】Three sum--C++源代码(VS2015)

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

/*
Three sum
*/

void QuickSort(vector<int> &vec,int left,int right)
{
if (vec.size() <= 1)
return;
if (left > right)
return;
int first = left;
int last = right;
int key = vec[first];
while (first < last)
{
while (first < last && vec[last] > key)
{
last--;
}
vec[first] = vec[last];
while (first < last && vec[first] < key)
{
first++;
}
vec[last] = vec[first];
}
vec[first] = key;
QuickSort(vec, left, first - 1);
QuickSort(vec, first + 1, right);
}

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

vector<int>::iterator k=vec.end()-1;
for (vector<int>::iterator i = vec.begin(); i != vec.end() - 2; i++)
{
if (i > vec.begin() && *i == *(i - 1))
continue;
vector<int>::iterator j = i + 1;
vector<int>::iterator k = vec.end() - 1;
while (j < k)
{
if (*i + *j + *k < target)
{
j++;
while (*j == *(j - 1) && j < k)
{
j++;
}
}
else if (*i + *j + *k > target)
{
k--;
while (*k == *(k + 1) && j < k)
{
k--;
}
}
else
{
result.push_back({ *i, *j, *k });
j++;
k--;
while (*j == *(j - 1) && j < k)
j++;
while (*k == *(k + 1) && j < k)
k--;
}
}
}
return result;
}

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

system("pause");
return 0;
}