题目
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. 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 and you may not use the same element twice.
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
思路
因为数组已经排好序,所以直接从两边向中间遍历配对即可
代码
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
for(int lf = 0, rt = numbers.size() - 1; lf < rt; ) {
int sum = numbers[lf] + numbers[rt];
if(sum < target) lf++;
else if(sum > target) rt--;
else return {lf + 1, rt + 1};
}
}
};