给定一个有序数组和一个目标数,用尽量短的时间获取当前数组中有多少个数小于给定的目标数
public class SortedSearch {
public static int countNumbers(int[] sortedArray, int lessThan) {
if (sortedArray==null || sortedArray.length==0){
return 0;
}
int low=0,high=sortedArray.length;
int mid = (low+high)/2;
while (low<=high){
if (sortedArray[mid]<lessThan){
return mid+1;
}else if (sortedArray[mid]>=lessThan){
mid = (low+mid)/2;
}
}
return 0;
}
public static void main(String[] args) {
System.out.println(SortedSearch.countNumbers(new int[] {
1, 3, 5, 7 }, 4));
}
}