class Solution:
def searchRange(self, nums: List[int], target: int) -> List[int]:
left,right=0,len(nums)-1
while(left<=right):
mid=(left+right)//2
if nums[mid]>target:
right=mid-1
else:
left=mid+1
right_bound=right if right>=0 and nums[right]==target else -1
left,right=0,len(nums)-1
while(left<=right):
mid=(left+right)//2
if nums[mid]>=target:
right=mid-1
else:
left=mid+1
left_bound=left if left<len(nums) and nums[left]==target else -1
return [left_bound,right_bound]
二分法左边界右边界
最新推荐文章于 2023-04-24 09:48:01 发布