剑指 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
<
=
n
u
m
s
.
l
e
n
g
t
h
<
=
1
0
5
0 <= nums.length <= 10^5
0<=nums.length<=105
−
1
0
9
<
=
n
u
m
s
[
i
]
<
=
1
0
9
-10^9 <= nums[i] <= 10^9
−109<=nums[i]<=109
nums 是一个非递减数组
−
1
0
9
<
=
t
a
r
g
e
t
<
=
1
0
9
-10^9 <= target <= 10^9
−109<=target<=109
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution {
public:
int search(vector<int>& nums, int target) {
int idx1 = lower_bound(nums.begin(), nums.end(), target) - nums.begin();
int idx2 = upper_bound(nums.begin(), nums.end(), target) - nums.begin();
return idx2-idx1;
}
};