【LeetNode2-1-7】Two sum--C++源代码(VS2015)

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

/*
Two sum
*/

vector<int> Solution(vector<int> &vec, int target)
{
unordered_map<int, int> Sum;
for (int i = 0; i < vec.size(); i++)
{
Sum[vec[i]] = i;
}
vector<int> result;
for (int i = 0; i < vec.size(); i++)
{
int gap = target - vec[i];
if (Sum.find(gap) != Sum.end() && Sum[gap] > i)
{
result.push_back(i);
result.push_back(Sum[gap]);
break;
}
}
return result;
}

int main()
{
int arr[] = { 1,2,3,4,5,6,7,8,9,10 };
vector<int> vec(&arr[0], &arr[10]);
vector<int> result;
result = Solution(vec, 19);

cout << "index1 = " << result[0] << ", index2 = " << result[1] << endl;
system("pause");
return 0;
}