怀化废品回收市场在哪_临沂自助建站软件_免费新闻源发布平台_做关键词优化的公司

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

class Solution:def searchRange(self, nums: List[int], target: int) -> List[int]:def find_first(nums, target):left, right = 0, len(nums) - 1result = -1while left <= right:mid = left + (right - left) // 2if nums[mid] == target:result = midright = mid - 1  # 继续向左搜索elif nums[mid] < target:left = mid + 1else:right = mid - 1return resultdef find_last(nums, target):left, right = 0, len(nums) - 1result = -1while left <= right:mid = left + (right - left) // 2if nums[mid] == target:result = midleft = mid + 1  # 继续向右搜索elif nums[mid] < target:left = mid + 1else:right = mid - 1return resultstart = find_first(nums, target)end = find_last(nums, target)return [start, end]