167. 两数之和 II - 输入有序数组
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
if(numbers.size()<2) return {};
int left = 0,right = numbers.size() - 1;
while(left < right)
{
if((numbers[left] + numbers[right]) == target) return {left+1, right+1};
else if((numbers[left] + numbers[right]) < target) left++;
else right--;
}
return {};
}
};
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
int l = 0, r = numbers.size() - 1;
while(l < r)
{
if(numbers[l] + numbers[r] == target) break;
else if(numbers[l] + numbers[r] < target) l++;
else r--;
}
return {l+1,r+1};
}
};