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