统计一个数字在升序数组中出现的次数。
public class Solution {
public int GetNumberOfK(int [] array , int k) {
int left=0;
int right=array.length;
int l=0,r=0;
while(left<right){
int mid=(left+right)/2;
if(array[mid]<k){
left=mid+1;
}else{
right=mid;
}
}
l=left;
left=0;
right=array.length;
while(left<right){
int mid=(left+right)/2;
if(array[mid]<=k){
left=mid+1;
}else{
right=mid;
}
}
r=right;
return r-l;
}
}