算法设计与应用基础

167. Two Sum II - Input array is sorted

Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution and you may not use the same element twice.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

解释：给定一个已经按升序排序的整数数组，查找两个数，使它们相加为一个特定的目标数。
功能twosum应该返回两个数字，他们总计达目标指数，其中指数必须小于指数。请注意，你的答案返回（包括指数和指数）不为零的基础。
您可以假设每个输入都有一个解决方案，您可能不使用同一个元素两次。
输入：数字= { 2，7，11，15 }，目标= 9
输出：index1 = 1，index2= 2

通过几行相等简单的代码即可完成题目要求

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