leetcode 167. Two Sum II - Input array is sorted

Descrpition

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 and you may not use the same element twice.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

My solution

下面是自己的AC的代码,但是算法时间复杂度较高. 排序信息没有完全利用好,我的方法应该是nlgn, 因为两层循环, 第一层是顺序遍历, 第二层是二分的方式查找target - numbers[i]值.
期间自己意识到了算法中包含重复计算的部分, 但未能及时想出优化方案. 更简单的方法是查看Discuss了.

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

int main(){
    int nums[] = {2,7,11,15};
    vector<int> numbers(nums,nums+4);
    Solution s;
    vector<int> res = s.twoSum(numbers,9);


     return 0;
}

Discuss

采用高低位两个指针夹逼方式!!

vector<int> twoSum(vector<int>& numbers, int target) {
    int lo=0, hi=numbers.size()-1;
    while (numbers[lo]+numbers[hi]!=target){
        if (numbers[lo]+numbers[hi]<target){
            lo++;
        } else {
            hi--;
        }
    }
    return vector<int>({lo+1,hi+1});
}

Reference

• leetcode 167