167. 两数之和 II - 输入有序数组

对撞指针

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