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

解析：這個題啊 那是非常的簡單，題目已經給出了已經排序的條件，所以我們直接類似二分搜索即可，但是我在拿到題的時候，就兩個循環在那遍歷求解，可以說這是非常不合理的解決方案，並且這個題非常的簡單，因爲，返回的數組就兩個數字，不像可能有多個值的情況。
代碼如下：

public static int[] twoSum(int[] numbers, int target) {
        int[] rev = new int[2];
        int lo=0, hi=numbers.length-1;
        while (numbers[lo]+numbers[hi]!=target){
            if (numbers[lo]+numbers[hi]<target){
                lo++;
            } else {
                hi--;
            }
        }
        rev[0] = 1+lo;
        rev[1] = 1+hi;
        return rev;
    }