Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2.


  • Your returned answers (both index1 and index2) are not zero-based.
  • You may assume that each input would have exactly one solution and you may not use the same element twice.


Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.


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


电子邮件地址不会被公开。 必填项已用*标注