leetcode链接:https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/
统计一个数字在排序数组中出现的次数。
示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: 2示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: 0
解题思路:最简单的方法就是暴力遍历计数。另一种方法是既然数组是有序的,那么可以采用二分查找,分别查找target的左边界和target+1的左边界角标,相减,就是所求的个数。
class Solution {
public int search(int[] nums, int target) {
return helper(nums,target+1)-helper(nums,target);
}
public int helper(int[] nums,int target){
int left = 0;
int right = nums.length-1;
while(left<=right){
int mid = (left+right)/2;
if(nums[mid]>=target){
right = mid-1;
}else{
left = mid+1;
}
}
return left;
}
}