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

双指针，0ms

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