Two Sum II - Input Array Is Sorted

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        l,r=0,len(numbers)-1
        while l<r:
            currentsum= numbers[l]+numbers[r]
            if currentsum>target:
                  r-=1 
                  while r>l and numbers[r]==numbers[r+1]:
                      r-=1
            elif currentsum<target:
                l+=1
                while l<r and numbers[l]==numbers[l-1]:
                     l+=1
            else:
                return ([l+1,r+1])
        return []