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

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        ptr1 = 0
        ptr2 = len(numbers)-1
        
        while True:
            if numbers[ptr1] + numbers[ptr2] == target:
                return [ptr1+1, ptr2+1]
            elif numbers[ptr1] + numbers[ptr2] > target:
                ptr2-=1
            else:
                ptr1+=1