题目
题目来源:https://leetcode-cn.com/problems/two-sum-ii-input-array-is-sorted
解题思路:设置两个指针,即对撞指针法
class Solution:
def twoSum(self, numbers: List[int], target: int) -> List[int]:
#
left=1
right=len(numbers)
while left<right:
if numbers[left-1]+numbers[right-1]>target: # 两端数字之和大于target,right向左移一步
right -= 1
elif numbers[left-1]+numbers[right-1]<target: # 两端数字之和小于target,leftleft向右移一步
left += 1
else:
return [left,right]
return []