题解 | #数字在升序数组中出现的次数#

记录

public class Solution {
    int num = 0;
    public int GetNumberOfK(int [] array , int k) {
        return TwoFind(array,k) - TwoFind(array,k - 1);
    }
    public int TwoFind(int[] array,int k){
       int low = 0;
       int high = array.length - 1;
        int mid;

       while (low <= high){
           mid = (low + high) / 2;
           if (array[mid] <= k){
               low = mid + 1;

           } else {
               high = mid - 1;
           } 
       }
        return low;
    }
}