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

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param nums int整型一维数组
 * @param numsLen int nums数组长度
 * @param k int整型
 * @return int整型
 */
int GetNumberOfK(int* nums, int numsLen, int k ) {
    // write code here
    int left = 0;
    int right = numsLen - 1;
    int flag = 0;
    int mid = 0;
    while (left <= right) {
        mid = left + (right - left) / 2;
        if (nums[mid] > k) {
            right = mid - 1;
        } else if (nums[mid] < k) {
            left = mid + 1;
        } else {
            flag = 1;
            break;
        }
    }
    if (flag) {
        int count = 1;
        int pos = 1;
        int prev = 1;
        while (nums[mid + pos] == k && (mid + pos) < numsLen)
            pos++;
        while (nums[mid - prev] == k && (mid - prev) >= 0)
            prev++;
        return count + pos + prev - 2;


    } else
        return 0;


}