leetcode + 排好序的two sum.

小堃哥

于 2018-07-05 10:26:49 发布

阅读量109

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/u013554860/article/details/80922986

版权

Leetcode 专栏收录该内容

450 篇文章 0 订阅

订阅专栏

点击打开链接

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