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

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.

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

Code

“`
class Solution(object):
def twoSum(self, numbers, target):
“””
:type numbers: List[int]
:type target: int
:rtype: List[int]
“””
#字典解法
#dict = {}
#for i, j in enumerate(numbers):
# if target - j in dict:
# return [i + 1, dict[j] + 1] if i < dict[target - j] else [dict[target - j] + 1, i + 1]
# else:
# dict[j] = i

    #双指针解法
    l, r = 0, len(numbers) - 1
    while r > l:
        cnt = numbers[l] + numbers[r]
        if cnt == target:
            return [l + 1, r + 1]
        elif cnt > target:
            r -= 1
        else:
            l += 1

Conclusion

这道题字典解法是通用于排序数组和非排序的数组，但是双指针解法是只能用于排序的数组。这样的话，其实对于非排序数组，假如不方便用字典实现的时候，可以考虑先排序，再用双指针来实现。