题目
题源
统计一个数字在排序数组中出现的次数。
示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: 2
示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: 0
限制:
0 <= 数组长度 <= 50000
注意:本题与主站 34 题相同(仅返回值不同):https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/
代码
方法1:
class Solution {
public int search(int[] nums, int target) {
if (nums.length == 0) return 0;
int count = 0;
for (int i = 0; i < nums.length; i++) {
if (nums[i] > target) break;
if (nums[i] == target) count++;
}
return count;
}
}
方法2,优化的二分法:
class Solution {
public int search(int[] nums, int target) {
return helper(nums, target) - helper(nums, target - 1);
}
private int helper(int[] nums, int target) {
int i = 0, j = nums.length - 1;
while (i <= j) {
int m = (i + j) / 2;
if (nums[m] <= target) i = m + 1;
else
j = m - 1;
}
return i;
}
}