1 题目
统计一个数字在排序数组中出现的次数。
示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: 2
示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: 0
限制:
0 <= 数组长度 <= 50000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
2 Java
2.1 方法一(递归)
class Solution {
public int search(int[] nums, int target) {
return helper(nums, 0, nums.length - 1, target);
}
public int helper(int[] nums, int l, int r, int target){
int res = 0;
if(l > r) return res;
int m = (r + l) / 2;
if(target < nums[m]) return helper(nums, l, m - 1, target);
if(target > nums[m]) return helper(nums, m + 1, r, target);
if(target == nums[m]){
res++;
int temp = m;
while(temp > 0 && target == nums[--temp]) res++;
temp = m;
while(temp < nums.length - 1 && target == nums[++temp]) res++;
}
return res;
}
}
2.2 方法二(迭代)
class Solution {
public int search(int[] nums, int target) {
if(nums.length == 0) return 0;
// 二分查找
int res = 0;
int l = 0, r = nums.length - 1, m = 0;
while(l <= r){
m = (r + l) / 2;
if(target < nums[m]) r = m - 1;
if(target > nums[m]) l = m + 1;
if(target == nums[m]) break;
}
// 确定前后该元素个数
if(target == nums[m]){
res++;
int temp = m;
while(temp > 0 && target == nums[--temp]) res++;
temp = m;
while(temp < nums.length - 1 && target == nums[++temp]) res++;
}
return res;
}
}
2.3 方法三(二分找边界,通解)
class Solution {
public int search(int[] nums, int target) {
if(nums.length == 0) return 0;
int l = left(nums, target);
int r = right(nums, target);
return l == -1 ? 0 : r - l + 1;
}
public int left(int[] nums, int target) {
int l = 0, r = nums.length - 1, m = 0;
while(l <= r){
m = (r + l) / 2;
if(target < nums[m]) r = m - 1;
if(target > nums[m]) l = m + 1;
if(target == nums[m]) r = m - 1; // 注意不是r = m
}
// 检查出界情况
if (l > nums.length - 1 || nums[l] != target)
return -1;
return l;
}
public int right(int[] nums, int target) {
int l = 0, r = nums.length - 1, m = 0;
while(l <= r){
m = (r + l) / 2;
if(target < nums[m]) r = m - 1;
if(target > nums[m]) l = m + 1;
if(target == nums[m]) l = m + 1; // 注意不是l = m
}
// 检查出界情况
if (r < 0 || nums[r] != target)
return -1;
return r;
}
}