leetcode_167. Two Sum II - Input array is sorted 有序数组中找和为特定数的两个数的下标

题目：

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. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

题意：

给定一个有序数组 和 一个给定的数，在数组中找两个数的下标，使这两个数的和等于给定的数

代码：

class Solution(object):
    def twoSum(self, numbers, target):
        """
        :type numbers: List[int]
        :type target: int
        :rtype: List[int]
        """
        
        n = len(numbers)
        
        if n >= 2 :
            res = []
            
            i = 0       #定义数组的起始位置
            j = n-1    #定义数组的终止位置，往中间开始遍历


            while i < j :
                if numbers[i] + numbers[j] == target :
                    res.append(i+1)
                    res.append(j+1)
                    return res
                else :
                    if numbers[i] + numbers[j] > target :
                        j -= 1
                    else :
                        if numbers[i] + numbers[j] < target :
                            i += 1
                            
                            

笔记：

找准遍历的起始位置，真的很重要