代码:
1226
class Solution {
public int[] twoSum(int[] numbers, int target) {
int[] ans = new int[2];
int n = numbers.length;
for(int i=0;i<n-1;i++){
int l = i+1,r = n-1;
while(l<=r){
int m = l+(r-l)/2;
if(numbers[i]+numbers[m]==target){
ans[0]=i+1;
ans[1]=m+1;
return ans;
}else if(numbers[i]+numbers[m]<target){
l = m+1;
}else{
r = m-1;
}
}
}
return ans;
}
}