167. Two Sum II - Input array is sorted

    public static int[] twoSum(int[] numbers, int target) {        int[] result = new int[2];        if(numbers == null || numbers.length == 0) {            return result;        }        for(int i = 0; i < numbers.length; i++) {            int index = binarySearch(numbers, i+1, target-numbers[i]);            if(index > 0) {                result[0] = i+1;                result[1] = index+1;                break;            }        }        return result;    }    public static int binarySearch(int[] nums, int start,int target) {        int i = start, j = nums.length-1,mid = 0;        boolean find = false;        while(i <= j) {            mid = (i+j)/2;            if(nums[mid] == target) {                find = true;                break;            }else if(nums[mid] > target) {                j = mid-1;            }else {                i = mid + 1;            }        }        if(find) {            return mid;        }else {            return -1;        }    }