python--hot 100--简单--1--34. 在排序数组中查找元素的第一个和最后一个位置

方法：核心思想是使用二分查找

代码：

from typing import List


class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        l, r, mid = 0, len(nums) - 1, 0

        # 查找一个target在nums中的位置
        while l <= r:
            mid = (l + r) >> 1
            if target < nums[mid]:
                r = mid - 1
            elif target > nums[mid]:
                l = mid + 1
            else:
                break

        if l > r:
            return [-1, -1]

        # 在(l, mid]中找左边界，该区域内的元素均小于等于nums[mid]
        r_ = mid - 1
        while l <= r_:
            mid_ = (l + r_) >> 1
            if target == nums[mid_]:
                r_ = mid_ - 1
            else:  # target > nums[mid_]的情况，不可能有target < nums[mid_]
                l = mid_ + 1

        # 在[l_, mid)中找右边界，该区域内的元素均大于等于nums[mid]
        l_ = mid + 1
        while l_ <= r:
            mid_ = (l_ + r) >> 1
            if target == nums[mid_]:
                l_ = mid_ + 1
            else:  # target < nums[mid_]的情况，不可能有target > nums[mid_]
                r = mid_ - 1
        return [l, r]


if __name__ == '__main__':
    solution = Solution()
    nums = [5, 7, 7, 8, 8, 10]
    target = 7
    nums = [5, 7, 7, 8, 8, 10]
    target = 6
    res = solution.searchRange(nums, target)
    print(res)

[题目源于leetcode hot 100]