Java [Leetcode 167]two Sum ii-input Array is sorted

Title Description:

Given an array of integers that's already sorted in ascending order, find, numbers such, they add up to a Specific target number.

The function twosum should return indices of the numbers such that they add up to the target, where index1 must is Les S than Index2. Please note that your returned answers (both Index1 and INDEX2) is not zero-based.

You may assume this each input would has exactly one solution.

Input:numbers={2, 7, one, A, target=9
Output:index1=1, index2=2

Problem Solving Ideas:

Dichotomy method.

The code is as follows:

public class Solution {public    int[] Twosum (int[] numbers, int target) {        int[] res = new INT[2];        int i = 0, j = numbers.length-1;        while (I < j) {        if (Numbers[i] + numbers[j] = = target) {        Res[0] = i + 1;        Res[1] = j + 1;        break;        } else if (Numbers[i] + numbers[j] > target) {        j--;        } else{        i++;        }        }        return res;    }}

　　

Java [Leetcode 167]two Sum ii-input Array is sorted