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

Subscribe to see which companies asked this question.

思路：

朴素方法：遍历数组，搜索target-nums[i]是否存在，如果存在，返回index即可，但是这样做时间复杂度高，python版本超时

python确实极简啊，3行搞定，可惜超时

class Solution(object):
    def twoSum(self, numbers, target):
        """
        :type numbers: List[int]
        :type target: int
        :rtype: List[int]
        """
        for i,num in enumerate(numbers):
            if (target-num) in numbers[i+1:]:
                return [i+1,numbers[i+1:].index(target-num)+2+i] 

c++版本如果顺序遍历也会出现超时的现象，那么换一下逆序？哇哈，AC了，看来测试case不够严谨啊.....

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

利用numbers是排序数组，可以吧复杂度降低到O(n)：

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