34. Search for a Range

最新推荐文章于 2023-05-16 11:33:46 发布

独鹿

最新推荐文章于 2023-05-16 11:33:46 发布

阅读量232

点赞数

分类专栏： leetcode ARRAY python 数据结构 list

本文链接：https://blog.csdn.net/lijjianqing/article/details/72520721

版权

leetcode 同时被 3 个专栏收录

165 篇文章 0 订阅

订阅专栏

python

76 篇文章 0 订阅

订阅专栏

ARRAY

25 篇文章 0 订阅

订阅专栏

class Solution(object):
def searchRange(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
l,r=0,len(nums)-1
start=-1
end=-1
for i in range(len(nums)):
if nums[l]==target:
start=l
if nums[r]==target:
end=r
if nums[l]<target:
l+=1
elif nums[r]>target:
r-=1

return [start,end]

O(N)

class Solution(object):
def searchRange(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""

ll=0
rr=1
start=self.subtree(nums,target,ll)
end=self.subtree(nums,target,rr)
return [start,end]
def subtree(self,nums,target,loor):
l,r=0,len(nums)-1
start=-1
end=-1
if loor==0:
while l<=r:
mid=l+(r-l)/2
if nums[mid]==target:
start=mid
r=mid-1
elif nums[mid]<target:
l=mid+1
else:
r=mid-1
return start
if loor==1:
while l<=r:
mid=l+(r-l)/2
if nums[mid]==target:
end=mid
l=mid+1
elif nums[mid]<target:
l=mid+1
else:
r=mid-1
return end