Two Sum

Update: The following solution is no longer passing the test's time limit.

Two Sum

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

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

class Solution {//the vector is NOT sorted
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        for(int ii = 0; ii < numbers.size(); ++ii){
            int const rest = target - numbers[ii];
            vector<int>::iterator it = find(numbers.begin()+ii+1, numbers.end(), rest);
                if (it != numbers.end()){
                    vector<int> r(1,ii+1);
                    r.push_back(1+it - numbers.begin() );
                    return r;
                }
        }//for ii
        return vector<int>(2,0);
    }//twoSum
};