二分搜索
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
int n=numbers.size();
int l=0,r=n-1;
vector<int> ans{1,2};
while(l<r)
{
int d=numbers[l]+numbers[r];
if(d>target)
r--;
else if(d<target)
l++;
else
{
ans[0]=l+1;
ans[1]=r+1;
return ans;
}
}
return ans;
}
};