题目:
给定一个按照升序排列的整数数组 nums
,和一个目标值 target
。找出给定目标值在数组中的开始位置和结束位置。
你的算法时间复杂度必须是 O(log n) 级别。
如果数组中不存在目标值,返回 [-1, -1]
。
示例 1:
输入: nums = [5,7,7,8,8,10]
, target = 8
输出: [3,4]
示例 2:
输入: nums = [5,7,7,8,8,10]
, target = 6
输出: [-1,-1]
代码:
class Solution:
def searchRange(self, nums: List[int], target: int) -> List[int]:
start = self.searchStartPos(nums,target)
if start == -1:
return [-1,-1]
else:
end = self.searchEndPos(nums,target)
return [start,end]
def searchStartPos(self,nums,target):
i = 0
j = len(nums)-1
while i<=j:
mid = (i+j)//2
if nums[mid] < target:
i = mid+1
elif nums[mid] > target:
j = mid-1
else:
if mid-1 >= 0:
if nums[mid-1] != target:
return mid
else:
j = mid-1
else:
return mid
return -1
def searchEndPos(self,nums,target):
i = 0
j = len(nums)-1
while i<=j:
mid = (i+j)//2
if nums[mid] < target:
i = mid+1
elif nums[mid] > target:
j = mid-1
else:
if mid+1 <= len(nums)-1:
if nums[mid+1] != target:
return mid
else:
i = mid+1
else:
return mid