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

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param nums int整型一维数组
 * @param k int整型
 * @return int整型
 */
function GetNumberOfK(nums, k) {
    let len = nums.length;
    if (len === 0) return 0;
    if (nums[0] > k || nums[len - 1] < k) return 0;
    // write code here
    let left = 0;
    let right = nums.length - 1;
    while (left <= right) {
        if (nums[left] > k || nums[right] < k) return 0;
        let mid = Math.floor((left + right) / 2);
        if (nums[mid] === k) {
            let i = mid;
            let j = mid;
            while (k === nums[i]) {
                i--;
            }
            while (k === nums[j]) {
                j++;
            }
            return j - i - 1;
        } else if (nums[mid] > k) {
            right = mid;
        } else {
            left = mid + 1;
        }
    }
    return 0;
}
module.exports = {
    GetNumberOfK: GetNumberOfK,
};