#include <iostream>
#include <vector>
#include <map>

using namespace std;
vector<int> TwoSum(vector<int> &numbers, int target) 
{
	map<int,int> mem; //use hashtable to make run time become O(n)
	vector<int> indics;
	for (int i = 0; i < numbers.size(); ++i)
	{
		map<int,int>::iterator it = mem.find(numbers[i]);
		if (it != mem.end()) //number has match
		{
            indics.push_back((*it).second);
		    indics.push_back(i+1);
			break;
		}

		//save subtitution
		mem[target - numbers[i]] = i+1;
	}

	return indics;
}



int main(int argc, char** argv)
{
	
	return 0;
}