leetcode 167. Two Sum II - Input array is sorted

这是今天的第二道题目，本来计划好的做三道，终究还是效率低。。。
167. Two Sum II - Input array is sorted
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.

我的思路还是最笨的那种，直接遍历：

class Solution {
    public int[] twoSum(int[] numbers, int target) {
        int[] indices = new int[2]; 
        for(int i=0;i<numbers.length;i++)
            for(int j=i+1;j<numbers.length;j++){
                if(numbers[i]+numbers[j]==target){
                    indices[0]=i+1;
                    indices[1]=j+1;
                    break;
                }
            }
        return indices;
    }
}

但这样耗时太大，高达122ms，速度倒数5.22%
后来一想，既然题目中说了输入的数组是有序的，那就要从这下手，毕竟刚做了一个用二分查找搜索有序数组的题目：35. Search Insert Position
可以设置两个索引，分别从左（数小）右（数大）两端开始向中间缩小区间查找满足的数，大大减少了比较次数。

class Solution {
    public int[] twoSum(int[] numbers, int target) {        
        int[] indices = new int[2];       
        int left=0;
        int right=numbers.length-1;
        while(left<right){
            int sum = numbers[left]+numbers[right];    
            if(sum==target){
               indices[0]=left+1;
               indices[1]=right+1;
               break;
              }
            else if(sum>target)
               right=right-1;
            else
               left=left+1;
             }
            return indices;
    }
}

这样，耗时1ms，排名位于前33%左右。