Leetcode#167. Two Sum II - Input array is sorted（双向查找））

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

「已注销」

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

阅读量205

点赞数 1

分类专栏：【LeetCode】 LeetCode 文章标签： leetcode array

本文链接：https://blog.csdn.net/xunalove/article/details/79280285

版权

【LeetCode】同时被 2 个专栏收录

103 篇文章 1 订阅

订阅专栏

LeetCode

96 篇文章 0 订阅

订阅专栏

题目

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

题意

给你一个已经升序排列好的整型数组，找出两个数，使两数相加之和等于所给的目标数，将两个数的下标输出来（下标从1开始）。

题解

数组是升序排列好的。
双向查找（结果会有三种情况）
1.L + R = target 找到
2.L + R < target L前进一个
3.L + R > target R后退一个
所有时间复杂度为0(n)

python代码

class Solution(object):
    def twoSum(self, numbers, target):
        """
        :type numbers: List[int]
        :type target: int
        :rtype: List[int]
        """
        res = []
        L=0
        R=len(numbers)-1
        while numbers[L] + numbers[R] != target:
            if numbers[L] + numbers[R] < target:
                L = L + 1

            if numbers[L] + numbers[R] > target:
                R = R - 1

        res.append(L+1)
        res.append(R+1)
        return res

C++代码

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        vector<int>res;
        int L=0, R=numbers.size()-1;
        while(numbers[L] + numbers[R] != target)
        {
            if(numbers[L] + numbers[R] < target){
                L++;
            }
             if(numbers[L] + numbers[R] > target){
                R--;
            }
        } 
        res.push_back(L+1);
        res.push_back(R+1);
        return res;

    }
};