Two Sum in a Sorted Array

10,26,30,31,47,60
l              r  70 > 40
怎样决定移动 l 还是 r？此处 70 已经大于 40 了，所以移动 r
l           r     57 > 40
l        r        41 > 40
l     r           40 = 40, return [10, 30]

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