class Solution:
def twoSum(self, numbers: List[int], target: int) -> List[int]:
left, right = 0, len(numbers)-1
while left<right:
if numbers[left] + numbers[right] == target:
return [left+1, right+1]
elif numbers[left] + numbers[right] > target:
right-=1
elif numbers[left] + numbers[right] < target:
left+=1
两数之和Ⅱ,输入有序数组
最新推荐文章于 2024-07-25 11:27:31 发布