public class Solution { public int GetNumberOfK(int [] array , int k) { if(array.length == 0){ return 0; } // 有序数组,想到用二分法来解决找数据 int left = 0 , right = array.length - 1 , mid = 0; while(left < right){ mid = left + (right - left)/2...