题目:
统计一个数字在排序数组中出现的次数。
示例 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
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof
思路:查找到元素第一次出现的位置,并向后遍历,直到遍历的元素不等于target或者遍历到数据末尾。
java代码:
class Solution {
public int search(int[] nums, int target) {
if(nums.length==0) {
return 0;
}
int left = 0;
int right = nums.length;
while (left < right) {
int mid = left + (right - left)/2;
if(nums[mid] < target) {
left = mid + 1;
} else {
right = mid;
}
}
int leftIndex = right;
int rightIndex = right;
while (rightIndex<nums.length&&nums[rightIndex] == target) {
rightIndex++;
}
return rightIndex - leftIndex;
}
}