167. Two Sum II - Input array is sorted

标签：for   ret   self   NPU   order   fun   ice   利用   target   

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.

Note:

• 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.

Example:

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.
从数组里找两个值，和等于target，保证有唯一答案
因为数组是排好序的，可以利用左右两个指针on的去寻找

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

167. Two Sum II - Input array is sorted

标签：for   ret   self   NPU   order   fun   ice   利用   target   

原文地址：https://www.cnblogs.com/whatyouthink/p/13232511.html