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

一开始写成了遍历的形式，没有超时，但运行速度很慢。代码具体如下：

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        //先写成遍历的形式
        int len=numbers.length;
        int res[] = new int[2];
        int flag=0;
        for(int i=0;i<len;i++){
            res[0]=i+1;
            for(int j=i+1;j<len;j++){
                if(numbers[i]+numbers[j]==target){
                    res[1]=j+1;
                    flag=1;
                    break;
                }
            }
            if(flag==1){break;}
        }
        return res;
    }
}

后来把for循环的条件改成了for(int j=i+1;j<len&&numbers[j]<=target;j++)但报错了，因为存在负值。

最后参考了一个网上的双指针版本，复杂度很低，0ms。

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int l = 0;
        int r = numbers.length - 1;//定义前后两个指针
        int res[]=new int[2];//已知数组大小时的声明；
        //数组定义并赋值用int[] res = {l + 1, r + 1};大括号形式
        while (l < r) {
            if (numbers[l] + numbers[r] == target) {
                res[0]=l+1;
                res[1]=r+1;//注意返回的数组坐标要+1
                break;
            } else if (numbers[l] + numbers[r] > target)
                r--;//如果和大于target则后端指针前移一位
            else
                l++;//如果和小于target则前端指针后移一位
        }
        return res;
    }
}