统计一个数字在排序数组中出现的次数。
示例 1:
输入: nums = [5,7,7,8,8,10], target = 8
输出: 2
示例 2:
输入: nums = [5,7,7,8,8,10], target = 6
输出: 0
限制:
0 <= 数组长度 <= 50000
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/zai-pai-xu-shu-zu-zhong-cha-zhao-shu-zi-lcof
代码思路:先用二分法找到这个数出现的位置,然后再往这个位置左边和右边找,我的论文一样长的垃圾代码:
class Solution:
def search(self, nums: List[int], target: int) -> int:
#二分法
if not nums:
return 0
left=0
right = len(nums)-1
while left<right:
mid = (left+right)>>1
if nums[mid]<target:
left=mid+1
elif nums[mid]>target:
right = mid
else:
left=mid
break
count=0
print(nums[left])
mid = left
while left<=len(nums)-1:
if nums[left]==target:
count+=1
left+=1
else:break
while 0<=mid:
if nums[mid]==target:
count+=1
mid-=1
else:break
if count>=1:
return count-1
else:
return 0
大佬的代码:找到左右边界后右减左减一
class Solution:
def search(self, nums: List[int], target: int) -> int:
i, j = 0, len(nums) - 1
while i <= j:
m = (i + j) // 2
if nums[m] <= target: i = m + 1
else: j = m - 1
right = i
i, j = 0, len(nums) - 1
while i <= j:
m = (i + j) // 2
if nums[m] < target: i = m + 1
else: j = m - 1
left = j
return right - left - 1