统计一个数字在排序数组中出现的次数。
剑指 Offer 53 - I. 在排序数组中查找数字 I - 力扣(LeetCode) (leetcode-cn.com)
思路:借助二分查找的思想,分别找到左边界和右边界,就能计算出数字出现的次数
class Solution {
public int search(int[] nums, int target) {
if(nums == null || nums.length == 0){
return 0;
}
int res = 0;
int left = 0;
int right = nums.length - 1;
int mid = -1;
int index = -1;
while(left < right){
mid = left + (right - left)/2;
if(nums[mid] >= target){
right = mid;
}else{
left = mid + 1;
}
}
if(nums[right] != target){
return 0;
}
res = right;
left = right;
right = nums.length - 1;
while(left < right){
mid = left + (right - left)/2 + 1;
if(nums[mid] > target){
right = mid - 1;
}else{
left = mid;
}
}
return left - res + 1;
}
}