LandscapeMi

landscapemi的博客

leetcode :Binary Search:Two Sum II - Input array is sorted(069)

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

http://www.cnblogs.com/grandyang/p/5185815.html


// O(n)
class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        int l = 0, r = numbers.size() - 1;
        while (l < r) {
            int sum = numbers[l] + numbers[r];
            if (sum == target) return {l + 1, r + 1};
            else if (sum < target) ++l;
            else --r;
        }
        return {};
    }
};
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/mijian1207mijian/article/details/52346318
个人分类: leetcode(c++)
上一篇leetcode :Binary Search:Sqrt(x)(069)
下一篇leetcode :Binary Search:Dungeon Game(174)
想对作者说点什么? 我来说一句

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

关闭
关闭