LeetCode 0167 - Two Sum II - Input array is sorted

Reck Zhang

发布于 2021-08-11 14:51:46

1520

发布于 2021-08-11 14:51:46

文章被收录于专栏：Reck Zhang

Two Sum II - Input array is sorted

Desicription

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.

Note:

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.

Example:

Input: numbers = [2,7,11,15], target = 9
Output: [1,2]
Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2.

Solution

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        for(int left = 0, right = numbers.size()-1; left < right; ) {
            if(numbers[left] + numbers[right] > target)
                right--;
            else if(numbers[left] + numbers[right] < target)
                left++;
            else if(numbers[left] + numbers[right] == target)
                return vector<int>{left+1, right+1};
        }
    }
};

本文参与腾讯云自媒体同步曝光计划，分享自作者个人站点/博客。

原始发表：2018-06-04，如有侵权请联系 cloudcommunity@tencent.com 删除

add