public class Solution {
    public int GetNumberOfK(int [] array , int k) {
       return findTheWay(array,k+0.5) - findTheWay(array,k-0.5);
    }
    
    private int findTheWay(int [] array , double k){
        int start = 0;
        int end = array.length - 1;
        int index = 0;
        while (start <= end){
            index = (start + end) / 2;
            if (array[index] > k){
                end = index - 1;
            } else {
                start = index + 1;
            }
        }
        return start;
    }
}