剑指 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
思路
- 循环数组,遍历到target目标值则递增,时间复杂度O(n),空间复杂度O(1)
- 因为数组是有序的,可以用二分查找到目标值的左边界和右边界,易知
问题就转换成了如何求取target的左右边界
而寻找target在数组里的左右边界,有如下三种情况:
- 情况一:target 在数组范围的右边或者左边,例如数组{3, 4, 5},target为2或者数组{3, 4, 5},target为6
- 情况二:target 在数组范围中,且数组中不存在target,例如数组{3,6,7},target为5
- 情况三:target 在数组范围中,且数组中存在target,例如数组{3,6,7},target为6
代码
代码比较冗余但是每个步骤都很容易理解
class Solution {
//二分法
public int search(int[] nums, int target) {
int left = searchLeft(nums, target);
int right = searchRight(nums, target);
if (left == -2 || right == -2) {
return 0;
} else if (right - left > 1) {
return right - left - 1;
} else {
return 0;
}
}
//寻找右边界:要让左边界去逼近右边界
public int searchRight(int[] nums, int target) {
int left = 0, right = nums.length - 1, flag = -2;
while (left <= right) {
int middle = left + (right - left) / 2;
if (nums[middle] <= target) {//寻找右边界
left = middle + 1;
flag = left;
} else {
right = middle - 1;
}
}
return flag;
}
//寻找左边界:要让右边界去逼近左边界
public int searchLeft(int[] nums, int target) {
int left = 0, right = nums.length - 1, flag = -2;
while (left <= right) {
int middle = left + (right - left) / 2;
if (nums[middle] >= target) {//寻找左边界
right = middle - 1;
flag = right;
} else {
left = middle + 1;
}
}
return flag;
}
}