JZ37 数字在排序数组中出现的次数

题目描述

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

代码

public class Solution {
    public int GetNumberOfK(int [] array , int k) {
        int low = 0;
        int high = array.length-1;
        int mid = (low+high)/2;
        int count = 0;
        while (high-low == 1 ){
            if (array[mid] > k) {
                high = mid;
            }else if (array[mid] < k){
                low = mid;
            }else {
                break;
            }
            mid = (low+high)/2;
        }
        for (int i = low; i <= high; i++) {
            if (array[i] == k) {
                count++;
            }
        }
            return count;
    }

}