[LeetCode/Python] 167. Two Sum II - Input Array Is Sorted

📌 Problem

[LeetCode] 167. Two Sum II - Input Array Is Sorted

📌 Solution

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