日常刷题6-统计一个数字在排序数组中出现的次数

需求，思路，由于数组是排序的，因此首要任务是先找到target

采用二分查找

class Solution {
public:
    int search(vector<int>& nums, int target) {
        if (nums.empty()) return 0;

        int l = 0, r = nums.size() - 1, res = 0;
        while (l < r)
        {
            int mid = (l + r) >> 1;
            if (nums[mid] >= target) r = mid;
            else l = mid + 1;
        }

        if (nums[l] != target) return 0;
        res = l;

        l = 0, r = nums.size() - 1;
        while (l < r)
        {
            int mid = (l + r + 1) >> 1;
            if (nums[mid] <= target) l = mid;
            else r = mid - 1;
        }

        return r - res + 1;
    }
};

结果