Leetcode #167. Two Sum II - Input array is sorted

Posted lettuan

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了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

 

在一个sorted list中寻找两数之和等于给定的target, 一般用双指针的方式解决。 

 1 class Solution(object):
 2     def twoSum(self, numbers, target):
 3         """
 4         :type numbers: List[int]
 5         :type target: int
 6         :rtype: List[int]
 7         """
 8         
 9         n = len(numbers)
10         i = 0
11         j = n-1
12         
13         while i < j:
14             if numbers[i] + numbers[j] == target:
15                 return [i+1,j+1]
16             elif numbers[i] + numbers[j] < target:
17                 i += 1
18             elif numbers[i] + numbers[j] > target:
19                 j -= 1 

 




以上是关于Leetcode #167. Two Sum II - Input array is sorted的主要内容,如果未能解决你的问题,请参考以下文章

LeetCode167. Two Sum II - Input array is sorted

LeetCode 167. Two Sum II - Input array is sorted

[LeetCode] 167. Two Sum II - Input array is sorted

LeetCode:167. Two Sum II - Input array is sorted

Leetcode #167. Two Sum II - Input array is sorted

Leetcode167. Two Sum II - Input array is sorted