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

Leetcode-34 [Find First and Last Position of Element in Sorted Array]

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

Companies

Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value.

If target is not found in the array, return [-1, -1].

You must write an algorithm with O(log n) runtime complexity.

给定一个按照升序排列的整数数组 nums，和一个目标值 target。找出给定目标值在数组中的开始位置和结束位置。
如果数组中不存在目标值 target，返回 [-1, -1]。
进阶：
你可以设计并实现时间复杂度为 O(log n) 的算法解决此问题吗？

Example 1:

Input: nums = [5,7,7,8,8,10], target = 8
Output: [3,4]

Example 2:

Input: nums = [5,7,7,8,8,10], target = 6
Output: [-1,-1]

Example 3:

Input: nums = [], target = 0
Output: [-1,-1]

Constraints:

0 <= nums.length <= 105
-109 <= nums[i] <= 109
nums is a non-decreasing array.
-109 <= target <= 109

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array

解法： 二分查找

一看就会，一写就废

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