统计一个数字在排序数组中出现的次数

public class Solution {
    public int GetNumberOfK(int [] array , int k) {
int len=array.length;
       int num=0;
if(array.length>0&&array!=null) {
int firstk=findfirst(array,k,0,len-1);
int lastk=findlast(array,k,0,len-1);

if(firstk>-1&&lastk>-1){
num=lastk-firstk+1;
}}
return num;
}
private static int findlast(int[] a, int k, int start, int end) {
if(start>end)return -1;
int mid=(start+end)/2;
if(a[mid]==k){
if(mid<a.length-1&&a[mid+1]!=k||mid==a.length-1){
return mid;
}else{
start=mid+1;
}
}else if(a[mid]>k){
end=mid-1;
}else{
start=mid+1;
}
return findlast(a,k,start,end);
}
private static int findfirst(int[] a, int k,int start, int end) {
if(start>end)return -1;
int mid=(end+start)/2;
if(a[mid]==k){
if(mid>0&&a[mid-1]!=k||mid==0){
return mid;
}else{
end=mid-1;
}
}else if(a[mid]>k){
end=mid-1;
}else{
start=mid+1;
}
return findfirst(a,k,start,end);
}
    }