167. Two Sum II

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 and you may not use the same element twice.

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

翻译：给定一个数组，这个数组已经排序好了，找到两个数字，使得他们相加的和是一个特定的目标数。

函数twoSun返回两个数字的下标，其中下标1必须小于下标2（返回的数从小到大排序）

可以假设每个输入的目标值都只有一个解决方案，并且不能使用相同的元素相加两次。

分析:只有一个解决方案，也就意味着输出的数组中只有两个数。

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