Leetcode-两数之和II

34.两数之和II

题目内容：

代码及思路：

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
	    vector<int> res;
	    int index1=0;
	    int index2 = numbers.size()-1;
	    while (index1 < index2)
	    {
		    if (numbers[index1] + numbers[index2] > target)
			    --index2;
		    else if (numbers[index1] + numbers[index2] < target)
			    ++index1;
		    else
		    {          
			    res.push_back(index1+1);
			    res.push_back(index2+1);
			    break;
		    }

	    }
        return res;
    }
};