题目描述:统计一个数字在排序数组中出现的次数。
题解:
public class Solution {
public int GetNumberOfK(int [] array , int k) {
int first = binSearch(array, k);
int last = binSearch(array, k+1);
return last-first;
}
int binSearch(int[] arr, int k){
int lo = 0, hi = arr.length;
while(lo<hi){
int m = lo +(hi-lo)/2;
if(arr[m]>=k)
hi=m;
else
lo= m+1;
}
return lo;
}
}