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

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

---

Analysis

ummmmm~—— [ummmmmm~]

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.
输入是一个按照升序排列的数组以及一个数字，找出数组中哪两个数的和等于给定数字，然后题目假设炳然存在一个解。需要注意的是返回的下标是从1开始的，所以找到相应的位置然后下标加一就行了。
PS：不要想着暴力解决，AC是不可能的！！

Implement

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        int len = numbers.size();
        vector<int> index;
        int first = 0;
        int last = len - 1;
        while(first < last){
            if(numbers[first] + numbers[last] == target){
                index.push_back(first+1);
                index.push_back(last+1);
                return index;
            }
            else if(numbers[first] + numbers[last] < target)
                first++;
            else if(numbers[first] + numbers[last] > target)
                last--;
        }
    }
};