剑指 Offer 53 - I. 在排序数组中查找数字 I
统计一个数字在排序数组中出现的次数。
示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: 2
示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: 0
提示:
0 <= nums.length <= 105
-109 <= nums[i] <= 109
nums 是一个非递减数组
-109 <= target <= 109
题解
二分法,查找重复区间的起始下标和终点下标,然后计算个数。
Code
class Solution {
public int search(int[] nums, int target) {
if(nums == null || nums.length == 0){
return 0;
}
int l1 = 0, r1 = nums.length - 1, mid1 = 0;
while(l1 < r1){
mid1 = (l1 + r1 + 1) >> 1;
if(nums[mid1] <= target){
l1 = mid1;
}else{
r1 = mid1 - 1;
}
}
int l2 = 0, r2 = nums.length - 1, mid2 = 0;
while(l2 < r2){
mid2 = (l2 + r2) >> 1;
if(nums[mid2] >= target){
r2 = mid2;
}else{
l2 = mid2 + 1;
}
}
if(l1 == l2 && nums[l1] != target){
return 0;
}
return l1 - l2 + 1;
}
}