【python】【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.

（输入一个有序递增整数列表，以及一个目标值。返回列表中加和为目标值的两个数的下标。

注意：列表下标从1开始。）

二、题目分析

思路：嵌套循环判断里外循环的数加和为目标值即可。

（因为要求是返回2个数的下标，且解决方案只有一种，则我们可以把列表中个数大于2的数字记在名为have_done列表中，

避免重复判断，用于优化时间）

三、Python代码

class Solution(object):
    def twoSum(self, numbers, target):
        """
        :type numbers: List[int]
        :type target: int
        :rtype: List[int]
        """
        result = []
        have_done = []
        for i in range(0, len(numbers)):
            if numbers[i] not in have_done:
                if numbers.count(numbers[i]) > 2:
                    have_done.append(numbers[i])
                    continue
                else:
                    for j in range(0, i+1):
                       if (numbers[i] + numbers[j] == target) and (i != j):
                           result.append(j+1)
                           result.append(i+1)
                           return result
            else:
                continue

四、其他

题目链接：https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/

Runtime: 59 ms

想法不够优化，欢迎大家留言交流~