Leetcode "1" and Sum

Given an array of integers, find the numbers such that they add up to a specific target number.

the function Twosum should return indices of the numbers such that they add up to the target, where index1 must is Le SS than Index2. Please note that your returned answers (both Index1 and INDEX2) is not zero-based.

You may assume this each input would has exactly one solution.

Input: numbers={2, 7, one, A, target=9
Output: index1=1, index2=2

Notice the bold exactly, with only one. So you don't have to think too much. Too much thinking is a liability. A direct double loop is no good, absolutely timed out. Not much to say, on the code:

vector<int> Twosum (vector<int> &numbers,inttarget) {Vector<int>index; Map<int,int>m;  for(inti =0; I < numbers.size (); ++i) {if(M.find (target-numbers[i])! =M.end ()) {Index.push_back (M[target-Numbers[i]] +1); Index.push_back (i+1);  Break; } M[numbers[i]]=i; }    returnindex;}

Leetcode "1" and Sum