LeetCode 167. Two Sum II - Input array is sorted

描述

给出一个有序数组，求是否存在两个数的和等于目标值

解决

遍历。

---

class Solution {public:    vector<int> twoSum(vector<int>& numbers, int target) {        int l = 0, r = numbers.size() - 1;        while (l < r)        {            int t = numbers[l] + numbers[r];            if (t == target)                return {l + 1, r + 1};            else if (t < target)                ++l;            else                --r;        }        return {};    }};