题目
分析
双指针法之头尾指针对撞。
代码
class Solution {
public:
vector<int> twoSum(vector<int>& numbers, int target) {
int left = 0;
int right = numbers.size() - 1;
while (left < right) {
int tmpSum = numbers[left] + numbers[right];
if (tmpSum == target) {
return {
left + 1, right + 1};
} else if (tmpSum < target) {
++left;
} else {
--right;
}
}
return {
-1, -1};
}
};