Given an array of integers that is already sorted in ascending order, 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.
Note:
- Your returned answers (both index1 and index2) are not zero-based.
- You may assume that each input would have exactly one solution and you may not use the same element twice.
Example:
Input: numbers = [2,7,11,15], target = 9 Output: [1,2] Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.
class Solution {
public:
class index_partner
{
public:
int index;
int partner;
};
vector<int> twoSum(vector<int>& numbers, int target)
{
vector<int> ans;
if(numbers.empty())return ans;
map<int,index_partner> m;
for(int i=0;i<numbers.size();i++)
{
if(m.count(numbers[i])>0)
{
ans.push_back(m[numbers[i]].index+1);
ans.push_back(i+1);
return ans;
}
index_partner t;
t.index=i;t.partner=numbers[i];
m[target-numbers[i]]=t;
}
return ans;
}
};