LeetCode 167. 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.

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.

方法一：最直接的思考，暴力解法。双层遍历，O(n²)。

暴力解法没有充分利用原数组的性质，即该数组是有序的，在最后一个测试数据的时候会超时。

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

方法二：利用二分搜索降低时间复杂度。

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        vector<int> nums;
        for (int i=0; i<numbers.size()-1; i++)
        {
            int k = binarySearch(numbers,i+1,numbers.size()-1,target-numbers[i]);
            if (k != -1) 
            {
                nums.push_back(i+1);
                nums.push_back(k+1);
                break;
            }
        }
        return nums;
    }
    
    int binarySearch(vector<int> nums,int l,int r,int target)
    {
        while (l <= r)
        {
            int mid = l + (r-l)/2;
            if (nums[mid] == target) return mid;
            if (nums[mid] > target) r = mid-1;
            else l = mid+1;
        }
        return -1;
    }
};

方法三：时间复杂度：O(n)，空间复杂度：O(1)，利用对撞指针来解决问题。

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        assert(numbers.size() >= 2);
        vector<int> nums;
        int i = 0,j = numbers.size()-1;
        while (i < j)
        {
            if (numbers[i] + numbers[j] == target)
            {
                nums.push_back(i+1);
                nums.push_back(j+1);
                return nums;
            }
            else if (numbers[i] + numbers[j] > target) j --;
            else i ++;
        }
        throw invalid_argument("The input has no solution.");
    }
};