167. *Two Sum II - Input array is sorted

167. *Two Sum II - Input array is sorted

https://leetcode.com/problems/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.

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.

解题思路

与 1. Two Sum 不同的地方是, 数组是排序的, 因此可以使用对撞指针. 要找到两个数等于 target, 由于数组是排序的, 那么这两个数必然是一左一右, 那么可以使用两个指针, 从数组的起始和尾部开始搜索, 如果 nums[i] + nums[j] 刚好等于 target, 那么, 直接返回. 如果和的结果小于 target, 那么说明 nums[i] 小了, 要增大, 应该 ++i; 如果结果大于 target, 说明 nums[j] 大了, 应该 --j.

另外, 注意一点: 题目中要求是返回的索引从 1 开始, 因此, i 和 j 要加 1.

C++ 实现

时间复杂度为 $O(N)$, 空间复杂度为 $O(1)$

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