lintcode刷题（python）——（4）

最新推荐文章于 2025-06-26 02:34:55 发布

平_繁

最新推荐文章于 2025-06-26 02:34:55 发布

阅读量1.6k

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 python

欢迎加我qq2693438633进行技术交流～

本文链接：https://blog.youkuaiyun.com/pyufftj/article/details/72456999

python 同时被 2 个专栏收录

14 篇文章

订阅专栏

算法

9 篇文章

订阅专栏

这篇博客介绍了如何解决已排序整数数组中找到两个数，使其和等于特定目标值的问题。文章着重讨论了如何在已排序的输入数组中找到解决方案，强调每个输入都有且仅有一个解。

友情提示：点击上面的“+”展开目录以便查看具体的题目

Two Sum - 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.

样例

Given nums = [2, 7, 11, 15], target = 9
return [1, 2]

这道题特别简单，唯一要注意的一点就是有相同数字时的处理，如[1，1，3，4] target=2，方法见下面代码。

class Solution:
    """
    @param nums {int[]} n array of Integer
    @param target {int} = nums[index1] + nums[index2]
    @return {int[]} [index1 + 1, index2 + 1] (index1 < index2)
    """
    def twoSum(self, nums, target):
        # Write your code here
        for i in range(len(nums)):
            if target-nums[i] in nums:
                if (target-nums[i])!=nums[i]:
                    return [i+1,nums.index(target-nums[i])+1]
                else:
                    if nums.count(nums[i])>1:
                        return [i+1,nums.index(target-nums[i])+2]