剑指 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 <= 数组长度 <= 50000
**注意:**本题与主站 34 题相同(仅返回值不同):https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/
解答:
class Solution {
//二分法
//时间复杂度:O(logN)。空间复杂度:O(logN)
int count = 0;
public int search(int[] nums, int target) {
int left = 0;
int right = nums.length - 1;
search(nums, target, left, right);
return count;
}
public void search(int[] nums, int target, int left, int right) {
if(left <= right){
int mid = (left + right) / 2;
if(nums[mid] == target){
count++;
search(nums, target, mid + 1, right);
search(nums, target, left, mid - 1);
}else if(nums[mid] > target){
search(nums, target, left, mid - 1);
}else{
search(nums, target, mid + 1, right);
}
}
}
}
参考自:
作者:LeetCode-Solution
链接:https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof/solution/mian-shi-ti-53-i-zai-pai-xu-shu-zu-zhong-cha-zha-5/
来源:力扣(LeetCode)
著作权归作者所有。商业转载请联系作者获得授权,非商业转载请注明出处。