Two Sum II - Input Array Is Sorted

lcpy gen -n 167   # by problem number
lcpy gen -s two_sum_ii_input_array_is_sorted   # by problem name

Input: numbers = [2,7,11,15], target = 9
Output: [1,2]

Input: numbers = [2,3,4], target = 6
Output: [1,3]

Input: numbers = [-1,0], target = -1
Output: [1,2]

class Solution:
    # Time: O(n)
    # Space: O(1)
    def two_sum(self, numbers: list[int], target: int) -> list[int]:
        left, right = 0, len(numbers) - 1
        while left < right:
            current = numbers[left] + numbers[right]
            if current == target:
                return [left + 1, right + 1]
            if current < target:
                left += 1
            else:
                right -= 1
        return []