class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
int l=0,r=numbers.size()-1;
while(1){
if(numbers[l]+numbers[r]==target) return {l+1,r+1};
else if(numbers[l]+numbers[r]>target) --r;
else ++l;
}
}
};
Leetcode 167. 两数之和 II - 输入有序数组
最新推荐文章于 2024-07-25 22:17:00 发布