[LeetCode] 167. Two Sum II - Input array is sorted

思路: 做了那么多sum问题了, 这个应该超级简单了吧. 双指针直接搞定了.

vector<int> twoSum(vector<int>& numbers, int target) { int left = 0, right = numbers.size() - 1; while (left < right) { int sum = numbers[left] + numbers[right]; if (sum == target) return vector<int>{left + 1, right + 1}; if (sum < target) left++; else right--; } return vector<int>(); }