Leetcode34-在排序数组中查找元素的第一个和最后一个位置

Leetcode34-在排序数组中查找元素的第一个和最后一个位置

class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        if not nums:
            return [-1, -1]
        def searchLeft(nums, target):
            left = 0
            right = len(nums) - 1
            while left < right:
                mid = (left + right) // 2
                if nums[mid] >= target:
                    right = mid
                else:
                    left =mid + 1
            if nums[left] != target:
                return -1
            return left

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

        left = searchLeft(nums, target)
        right = searchRight(nums, target)
        return [left, right]