public class Solution { public int GetNumberOfK(int [] array , int k) { int left = 0,right = array.length-1; if(array.length == 0){ return 0; } while(left<=right){ int mid = left+(right-left)/2; if(array[mid] == k){ right = mid-1; }else if(array[mid] > k){ right = mid -1; }else if(array[mid] <k){ left = mid+1; } } int sum = 0; while(left<array.length&&array[left] == k){ sum++; left++; } return sum; } }