【LeetCode】Python代码实现 之 面试题53 - I. 在排序数组中查找数字

统计一个数字在排序数组中出现的次数。

示例 1:

输入: nums = [5,7,7,8,8,10], target = 8
输出: 2
示例 2:

输入: nums = [5,7,7,8,8,10], target = 6
输出: 0

解答：

# 方法1，使用二分查找与递归
count = 0
def search(nums, target):
    global count
    if len(nums) == 0: return 0
    # 二分查找
    mid = len(nums)//2
    if nums[mid] == target:
        count += 1
        search(nums[mid + 1:], target)
        search(nums[:mid], target)
    if nums[mid] < target:
        search(nums[mid+1:], target)
    if nums[mid] > target:
        search(nums[:mid], target)

# 方法2，如果数组里的值为整数可使用词方法，找下界方法
def helper(nums, tar):
    i, j = 0, len(nums)-1
    while i <= j:
        mid = (i+i)//2
        if nums[mid] <= tar:
            i = mid + 1
        else:
            j = mid - 1
    return i


def search(nums, tar):
    return helper(nums, tar) - helper(nums, target-1)

# 方法3， 寻找上界与下界
class Solution:
    def search(self, nums: [int], target: int) -> int:
        # 搜索右边界 right
        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
        # 若数组中无 target ，则提前返回
        if j >= 0 and nums[j] != target: return 0
        # 搜索左边界 left
        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