LeetCode 167. Two Sum II - Input array is sorted

最新推荐文章于 2018-09-14 08:46:32 发布

HelloSilicat

最新推荐文章于 2018-09-14 08:46:32 发布

阅读量161

点赞数

分类专栏： Leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/peisir/article/details/76223855

版权

Leetcode 专栏收录该内容

65 篇文章 0 订阅

订阅专栏

167. Two Sum II - Input array is sorted

Description

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

Solution

题意即给一个升序数组，并给出一个目标和，要求返回两个下标，该组下标对应的数字和为目标和.
我的做法是用两个游标控制上下界，如果和大于目标和，就调整第二个游标减小，小于的话，就调整第一个游标增大，否则就是我们想要的结果.
如果有遗漏之处，请不吝指教，十分感谢。代码如下

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        int i = 0,j = numbers.size() - 1;
        vector<int> rnt;

        while (i < j) {
            if (numbers[i] + numbers[j] == target) {
                rnt.push_back(i + 1);
                rnt.push_back(j + 1);
                break;
            }
            else if (numbers[i] + numbers[j] > target) {
                j--;
            }
            else {
                i++;
            }
        }
        return rnt;
    }
};