统计一个数字在排序数组中出现的次数。
示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: 2
示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: 0
class Solution {
public:
int search(vector<int>& nums, int target) {
int left=0, right=nums.size()-1;
int count=0;
while(left < right){
int mid=(left+right)/2;
if(nums[mid]>=target){
right=mid;
}else{
left=mid+1;
}
}
while(left<nums.size() && nums[left++]==target){
count++;
}
return count;
}
};