Description
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 and you may not use the same element twice.
Example
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
Explain
一般做法是O(n^2)扫数组,两两求和是否为target,优化做法是锁定第一个数,二分查找第二个数,时间复杂度为O(nlogn)
Code
class Solution(object):
def twoSum(self, numbers, target):
"""
:type numbers: List[int]
:type target: int
:rtype: List[int]
"""
num_len = len(numbers)
for i,x in enumerate(numbers):
low = i + 1
high = num_len - 1
while low <= high:
mid = (low + high) >> 1
if numbers[mid] + x == target:
return [i + 1, mid + 1]
if numbers[mid] + x > target:
high = mid - 1
elif numbers[mid] + x < target:
low = mid + 1