版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/glw0223/article/details/88833899
分析
- 双指针法(这是常用的方法)
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
int l=0,r=numbers.size()-1;
vector<int> result;
while (l<r){
if (numbers[l]+numbers[r]==target){
result.push_back(l+1);
result.push_back(r+1);
break;
} else if(numbers[l]+numbers[r]<target)
l++;
else
r--;
}
return result;
}
};