【数组-简单】剑指 Offer II 006. 排序数组中两个数字之和

题目
代码

class Solution:
    def twoSum(self, numbers: List[int], target: int) -> List[int]:
        left,right=0,len(numbers)-1
        while left<right:
            s=numbers[left]+numbers[right]
            if s>target:
                right-=1
            elif s<target:
                left+=1
            else:
                return left,right
        return []