手写 lower_bound
class Solution(object):
def searchRange(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
Len=len(nums)
if Len==0:return [-1,-1]
l=0
r=Len-1
while l<r:
m=(l+r)/2
if nums[m]<target:
l=m+1
else :
r=m
if nums[r]!=target:
return [-1,-1]
ansl=r
ansr=r
while r<Len:
if nums[r]==target:
ansr=r
r+=1
else:break
return [ansl,ansr]