从零开始的LC刷题(38): 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.

Note:

• 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.

Example:

Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

这道题是two sum i的延续：https://blog.csdn.net/cyr429/article/details/89437821

还是找两个和为定值的数，但是数列是已经排序的，这就简单了，只要设置一个从头到尾一个从尾到头的指针就能只遍历一遍得出结果，结果：

Success

Runtime: 4 ms, faster than 99.42% of C++ online submissions for Two Sum II - Input array is sorted.

Memory Usage: 9.4 MB, less than 78.18% of C++ online submissions for Two Sum II - Input array is sorted.

代码：

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        int i=0,j=numbers.size()-1;
        vector<int> res;
        while(i<j){
            int temp=numbers[i]+numbers[j];
            if(temp==target){res.push_back(i+1);res.push_back(j+1);return res;}
            else if(temp>target){j--;continue;}
            else {i++;}
        }
        return res;
    }
};