Description
统计一个数字在排序数组中出现的次数。
示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: 2
示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: 0
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
Solution
针对target和target-1两次二分
class Solution:
def search(self, nums: List[int], target: int) -> int:
def binary_search(target):
l, r = 0, len(nums)
while l < r:
m = l + (r - l) //2
if nums[m] <= target:
l = m + 1
else:
r = m
return l
return binary_search(target) - binary_search(target-1)