统计一个数字在排序数组中出现的次数。
输入: nums = [5,7,7,8,8,10], target = 8
输出: 2输入: nums = [5,7,7,8,8,10], target = 6
输出: 0
使用二分查找找出左右边界,再相减得到次数。
class Solution {
public:
int halfSearchLeft(vector<int> a,int size,int val){
int mid,index;
int start=0,end=size; // 左闭右开
while(start<end){
mid = start+(end-start)/2;
if(a[mid]<val) start = mid+1;
else if(a[mid]>=val) end = mid; // 不断向左收缩
}
if(start==size) return -1;
return (a[start]==val)? start:-1;
}
int halfSearchRight(vector<int> a,int size,int val){
int mid,index;
int start=0,end=size; // 左闭右开
while(start<end){
mid = start+(end-start)/2;
if(a[mid]<=val) start = mid+1; // 不断向右收缩
else if(a[mid]>val) end = mid;
}
if(end==0) return -1;
return (a[start-1]==val)? start-1:-1;
}
int search(vector<int>& nums, int target) {
int r=halfSearchRight(nums,nums.size(),target);
int l=halfSearchLeft(nums,nums.size(),target);
if(r!=-1&&l!=-1) return r-l+1;
else return 0;
}
};