LeetCode167: Two Sum II - Input array is sorted

题目链接：Two Sum II - Input array is sorted

1. 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.

2. 思路1: hashmap

和之前的2sum的思路一样,　使用hashmap

class Solution {
public:
    vector<int> twoSum(vector<int>& numbers, int target) {
        unordered_map<int, int> sum;
        //vector<int> result;
        for(int i = 0; i< numbers.size(); i++){
            sum[numbers[i]] = i;
        }
        for(int i = 0; i < numbers.size() - 1; i++){
            int key = target - numbers[i];
            if ((sum.count(key)) && (i!= sum[key]))
                return {i+1, sum[key]+1};
        }
        return {};
    }
};

因为涉及到建立hash表，会用到二个for循环，以及第二个for循环里面会有一个if判断语句，所以整个执行速度还不是很快的。

2. 思路２: 2pointer 大法

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

速度提升了不少：

注意：　这个和之前的two sum区别在哪？

• 有同学可能认为，如果我们第一步运行sort, 然后套用本题的2 pointer就可以了。但是是不可以的，因为如果我们第一步就进行sort的话，那么我们就丢失了下标信息了，这个时候就再也找不到正确的下标信息了，这点也是这一题和之前的two sum的区别所在啦～

two sum 系列写写到这里，接下来学习下一个专题～