第九周-Python-leetcode-hw1

题目

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.

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.

思路

题目已经说了有且仅有一个解，可以直接遍历，$O(n^2)$复杂度。过了前16个测试，但是最后那个超时，所以遍历的时候加了个判断，如果当前的numbers[i]和numbers[i+1]是一样的，那么它们之一和其他数相加会得到一样的结果，所以直接进入下一次循环。要注意的是，必须保证numbers[i]+numbers[i+1]!=target

代码

class Solution(object):
    def twoSum(self, numbers, target):
        for i in range(0, len(numbers)-1, 1):
            if numbers[i] == numbers[i+1] and numbers[i] + numbers[i+1] is not target:
                continue
            for j in range(i+1, len(numbers), 1):
                if numbers[i] + numbers[j] == target:
                    return [i+1, j+1]