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

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

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

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


class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        n = len(nums)
        min = n-1
        max = 0
        flag = 0

        # find min
        left = 0
        right = n-1
        while left<=right:
            mid = (left+right)//2
            if nums[mid] == target:
                flag = 1
                if mid<=min:
                    min = mid
                if mid-1 >= 0 and nums[mid] == nums[mid-1]:
                    right = mid-1
                else:
                    break
            elif nums[mid] > target:
                right = mid-1
            else:
                left = mid+1

        # find max
        left = 0
        right = n-1
        while left<=right:
            mid = (left+right)//2
            if nums[mid] == target:
                flag = 1
                if mid>=max:
                    max = mid
                if mid+1 <= n-1 and nums[mid] == nums[mid+1]:
                    left = mid+1
                else:
                    break
            elif nums[mid] > target:
                right = mid-1
            else:
                left = mid+1

        if flag == 0:
            return [-1, -1]
        else:
            return [min, max]