LeetCode – Refresh – Two Sum II

Here's the one I mentioned before. It comes as sorted array.

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        int start = 0, end = numbers.size()-1, sum = 0;
        vector<int> result(2);
        while (start < end) {
            sum = numbers[start] + numbers[end];
            if (sum == target) {
                result[0] = start+1;
                result[1] = end+1;
                return result;
            }
            if (sum > target) end--;
            else start++;
        }
    }
};