题目链接:https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted/
题目如下:
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
int low=0,high=numbers.size()-1;
while(low<=high){
int sum=numbers[low]+numbers[high];
if(sum>target) high--;
else if(sum<target) low++;
else break;
}
return {low+1,high+1};
}
};