统计一个数字在排序数组中出现的次数。
示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: 2
示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: 0
提示:
0 <= nums.length <= 105
-109 <= nums[i] <= 109
nums 是一个非递减数组
-109 <= target <= 109
int search(vector<int>& nums, int target) {
return searchpro(nums,target)-searchpro(nums,target-1);
}
int searchpro(vector<int>& nums,int target){
int i=0,j=nums.size()-1;
while(i<=j){
int mid=(i+j)/2;
if(nums[mid]<=target)
i=mid+1;
else
j=mid-1;
}
return i;
}