剑指 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
我的解法:
已知数组是按从小到大排序好的。找出数列中与target相等的数的索引值mid,然后以mid为基准向左向右遍历,统计等于target的元素的个数
class Solution:
def search(self, nums, target: int) -> int:
if not nums: return 0
start = 0
end = len(nums) -1
mid = 0
while start <= end:
mid = (start + end)//2
if nums[mid] < target:
start = mid + 1
elif nums[mid] > target:
end = mid - 1
else:
break# 找到target
if start>end:return 0
count = 1
mid_l,mid_r = mid-1,mid+1
while mid_l>=0 and nums[mid_l]==target:
count += 1
mid_l -=1
while mid_r < len(nums) and nums[mid_r]==target:
count += 1
mid_r +=1
return count
参考解法:
分别找出target和target-1在数组中的右边界,相减后为target的数目
class Solution:
def search(self, nums: List[int], target: int) -> int:
def searchRight(right: int):
i ,j = 0 ,len(nums)-1
while i <=j:
m=(i+j)//2
if nums[m]<=right:# 小于等于target,都继续找,直到刚好>target,i与j碰到一起,跳出循环。
i=m+1
else:
j=m-1
return j
return searchRight(target)- searchRight(target-1)