一、问题描述
统计一个数字在排序数组中出现的次数。
二、测试数据
示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: 2
示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: 0
提示:
0 <= 数组长度 <= 50000
三、解题思路
利用 二分查找
- 找到最左边符合要求的位序
- 找到最右边符合要求的位序
//找到最左边符合要求的位序
public int binarySearchFindFirst(int[] number,int target){
int high = number.length - 1;
if(high>=0&&number[0]==target) return 0;//判断位序为 0 是否满足要求
int low = 0,mid;
while(low<=high){
mid = (high+low)/2;
if(number[mid] == target){
if((mid -1)>=0&&number[mid - 1] < target) return mid;//若中间√,判断左边一个是否相等,不相等即为找到直接返回 mid
high = mid - 1;//左边一个相等将改变 high
}else if(number[mid] < target){
low = mid + 1;
}else{
high = mid - 1;
}
}
return -1;
}
四、java实现
class Solution {
public int search(int[] nums, int target) {
int indexFirst = binarySearchFindFirst(nums,target);
int indexLast = binarySearchFindLast(nums,target);
if(indexFirst == -1||indexLast == -1) return 0;
return indexLast - indexFirst + 1;
}
public int binarySearchFindFirst(int[] number,int target){
int high = number.length - 1;
if(high>=0&&number[0]==target) return 0;//判断位序为 0 是否满足要求
int low = 0,mid;
while(low<=high){
mid = (high+low)/2;
if(number[mid] == target){
if((mid -1)>=0&&number[mid - 1] < target) return mid;
high = mid - 1;
}else if(number[mid] < target){
low = mid + 1;
}else{
high = mid - 1;
}
}
return -1;
}
public int binarySearchFindLast(int[] number,int target){
int high = number.length - 1;
if(high>=0&&number[high]==target) return high;//判断位序为 length - 1 是否满足要求
int low = 0,mid;
while(low<=high){
mid = (high+low)/2;
if(number[mid] == target){
if((mid+1)<= number.length - 1)&&number[mid + 1] > target) return mid;
low = mid + 1;
}else if(number[mid] > target){
high = mid - 1;
}else{
low = mid + 1;
}
}
return -1;
}
}