题目描述:
统计一个数字在排序数组中出现的次数。
示例:
输入: nums = [5,7,7,8,8,10], target = 8
输出: 2
题解1:排序数组中的搜索问题,优先想到二分查找法解决!要注意边界条件:数组中可能根本就没target。这题用了两次二分查找,分别找到右边界和左边界
class Solution:
def search(self, nums: List[int], target: int) -> int:
i = 0
j = len(nums)-1
#找右边界,是指target右边的那一位
while i <= j:
m = (i+j)//2
if nums[m] <= target:
i = m + 1
else:
j = m-1
right = i
#若数组中无 target ,则提前返回,因为这时候j已经小于i了,所以j肯定对应target
if j >= 0 and nums[j] != target:
return 0
i = 0
#找左边界
while i <= j:
m = (i+j)//2
if nums[m] < target:
i = m + 1
else:
j = m - 1
left = j
return right - left - 1
题解2:用哈希表来遍历
class Solution:
def search(self, nums: List[int], target: int) -> int:
dic = {}
for i in nums:
if i not in dic:
dic[i] = 1
else:
dic[i] = dic[i] + 1
if target in dic:
return dic[target]
else:
return 0