统计一个数字在排序数组中出现的次数。
示例 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 <= 10^5
- -109 <= nums[i] <= 10^9
- nums 是一个非递减数组
- -109 <= target <= 10^9
Code:
class Solution {
public:
int search(vector<int>& nums, int target) {
return count(nums.begin(),nums.end(),target);
}
};