167.Two Sum II - Input array is sorted (Easy)
Leetcode / 力扣
題目描述：在有序數(shù)組中找出兩個(gè)數(shù)夸浅，使它們的和為 target咬荷。
Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2
public int[] twoSum5(int[] numbers, int target) {
int len = numbers.length;
int i = 0;
int j = len/2;
while(i<j){
int sum = numbers[i] + numbers[j];
if (sum == target){
return new int[]{i+1,j+1};
}if (sum < target){
i++;
}else {
j--;
}
}
return null;
}
