Leetcode NO.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.

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

本题是刚加进来的收费题目，讨论区里还没有什么人贴出答案，所以我也不知道我写出的是不是最优解，反正通过了测试，但是感觉这么简单不像是medium的难度，所以觉得可能有更好方法吧，如果大家得到更好的优化方法，欢迎指正。

代码如下：

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        vector<int> retVal;
        if (numbers.size() < 2)
        	;
        else {
        	int i = 0;
        	int low = 0;
        	int high = 0;
        	int mid = 0;
        	int target_temp = 0;
        	bool flag = false;
        	while (i < numbers.size()-1) {
        		low = i + 1;
        		high = numbers.size() - 1;
        		target_temp = target - numbers[i];
        		while (low <= high) {
        			mid = (low + high) / 2;
        			if (target_temp == numbers[mid]) {
        				retVal.push_back(i+1);
        				retVal.push_back(mid+1);
        				flag = true;
        				break;
        			}
        			else if (target_temp < numbers[mid])
        				high = mid - 1;
        			else
        				low = mid + 1;
        		}
        		if (flag == true)
        			break;
        		++i;
        	}
        }
        return retVal;
    }
};

思路很直接，就是把num[0] - num[length-2]遍历一遍，每个num[i]都计算目标搜索值，即target - num[i]，然后在num[i+1]到num[length-1]这个序列中运用binary search寻找该值，寻找到，则跳出，并返回index。。