167. Two Sum II - Input Array Is Sorted

167. 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
        res = []
        while l < r:
            if numbers[l]+numbers[r] < target:
                l +=1
            elif numbers[l]+numbers[r] > target:
                r -=1
            else: # numbers[l]+numbers[r] == target
                res.append(l+1)
                res.append(r+1)
                break
        return res

 

 

https://youtu.be/cQ1Oz4ckceM?si=cQZ68c1mfJdS072N