leetcode.0167. Two Sum II - Input array is sorted

最新推荐文章于 2022-04-08 20:13:30 发布

qq_37954325

最新推荐文章于 2022-04-08 20:13:30 发布

阅读量169

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode

本文链接：https://blog.youkuaiyun.com/qq_37954325/article/details/81775683

leetcode 专栏收录该内容

10 篇文章

订阅专栏

本文介绍了一种解决有序数组中寻找两个数使其和为目标值的问题的方法。利用双指针技巧，从数组两端向中间搜索，高效找到符合条件的元素对。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

leetcode.0167. 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.

参考答案（python3）

class Solution:
    def twoSum(self, numbers, target):
        """
        :type numbers: List[int]
        :type target: int
        :rtype: List[int]
        """

        '''
        思路

        利用两个指针从数组的两侧开始向中间移动，寻找第一对和为target的两个数即为所求
        '''
        left, right = 0, len(numbers) - 1
        while left < right:
            if numbers[left] + numbers[right] == target:
                return [left + 1, right + 1]
            elif numbers[left] + numbers[right] > target:
                right -= 1
            else:
                left += 1