LeetCode - 167. Two Sum II - Input array is sorted

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        int l=0, r=numbers.size()-1;
        while(l<r){
            int cur = numbers[l]+numbers[r];
            if(cur==target) return {l+1, r+1};
            else if(cur<target) l++;
            else r--;
        }
        return {};
    }
};