Ekinnn

芝士就是力量~✌️

leetcode167

1、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.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
思路跟二分法很相似,对于排好序的数组,一大一小从两头向中间走~~复杂度也只是O(n)哦~

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        vector<int> result;
        int length=numbers.size();
        int low=0,high=length-1;
        while(low<=high){
            if(numbers[high]+numbers[low]<target)
                ++low;
            else if(numbers[high]+numbers[low]>target)
                --high;
            else{
                result.push_back(low+1);
                result.push_back(high+1);
                break;
            }
        }
        return result;
    }
};
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/Ekinnn/article/details/53996131
文章标签: leetcode bs
个人分类: bj+array
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭