python 二分查找_python-leetcode34在排序数组中查找元素的第一个和最后一个位置(细节是魔鬼的二分查找)...

背景：

给定一个按照升序排列的整数数组 nums，和一个
目标值 target。找出给定目标值在数组中的开始
位置和结束位置
时间复杂度必须是 O(log n) 级别。
不存在目标值，返回 [-1, -1]

解法：

# 利用二分查找搜索左右边界
class Solution:
    def searchRange(self, nums, target):
        if not nums:
            return [-1, -1]

        return self.search_left(nums, target), self.search_right(nums, target)

    def search_left(self, nums, target):
        left = 0
        right = len(nums) - 1
        while left <= right:
            mid = (right - left) // 2 + left
            if nums[mid] < target:
                left = mid + 1
            elif nums[mid] > target:
                right = mid - 1
            else:
                right = mid - 1
        if left > len(nums) - 1 or nums[left] != target:
            return -1
        return left

    def search_right(self, nums, target):
        left = 0
        right = len(nums) - 1
        while left <= right:
            mid = (right - left) // 2 + left
            if nums[mid] < target:
                left = mid + 1
            elif nums[mid] > target:
                right = mid - 1
            else:
                left = mid + 1
        if right < 0 or nums[right] != target:
            return -1
        return right


class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        if not nums:
            return [-1, -1]

        return self.search_index(nums, target, -1), self.search_index(nums, target, 1)

    def search_index(self, nums, target, direction=1):
        """-1 means search left,1 means search right"""
        if direction not in (1, -1):
            raise ValueError('direction could only be -1 or 1')
        left = 0
        right = len(nums) - 1
        while left <= right:
            mid = (right - left) // 2 + left
            if nums[mid] < target:
                left = mid + 1
            elif nums[mid] > target:
                right = mid - 1
            else:
                if direction == -1:
                    right = mid - 1
                else:
                    left = mid + 1
        if direction == -1:
            if left > len(nums) - 1 or nums[left] != target:
                return -1
            return left
        else:
            if right < 0 or nums[right] != target:
                return -1
            return right

总结：

二分查找看起来很简单，细节是魔鬼，推荐看一篇文档，方便深刻理解二分查找的细节

力扣​leetcode-cn.com