public static int rank(int key,int[] num){
int left=0;
int right=num.length-1;
while(left<=right){
int mid=left+(right-left)/2;
if(key<num[mid]){
right=mid-1;
}
if(key>num[mid]){
left=mid+1;
}
if(key==num[mid]){
return mid;
}
}
return -1;
}
二分查找
于 2018-09-26 10:29:29 首次发布