关闭

leetcode167

标签: leetcodebs
79人阅读 评论(0) 收藏 举报
分类:

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;
    }
};
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:7076次
    • 积分:635
    • 等级:
    • 排名:千里之外
    • 原创:59篇
    • 转载:1篇
    • 译文:0篇
    • 评论:0条