leetcode167

                   167. Two Sum II - Input array is sorted

Description:

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.

解题思路：

题目中已说明数组按升序排序，即第一个元素最小，最后一个元素最大，先用两个指针分别指向数组第一个和最后一个元素，比较两个元素之和sum与target的值，当sum=target时返回索引，当sum<target时，说明左边指针指向的元素过小，指针右移，当sum>target时，说明右边指针指向的元素过大，指针左移，当左指针不再小于右指针时结束循环。

代码如下：

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        
        vector<int> result;
        int left = 0;
        int right = numbers.size() - 1;

        while(left < right) {
            int sum = numbers[left] + numbers[right];
            if (sum == target) {
                result.push_back(left+1);
                result.push_back(right+1);
                break;
            } 
            if (sum < target) {
                left++;
            } 
            if (sum > target) {
                right--;
            }
        }
        return result;
    }
};