给你一个按照非递减顺序排列的整数数组 nums
,和一个目标值 target
。请你找出给定目标值在数组中的开始位置和结束位置。
如果数组中不存在目标值 target
,返回 [-1, -1]
。
你必须设计并实现时间复杂度为 O(log n)
的算法解决此问题。
示例 1:
输入:nums = [5,7,7,8,8,10]
, target = 8
输出:[3,4]
示例 2:
输入:nums = [5,7,7,8,8,10]
, target = 6
输出:[-1,-1]
示例 3:
输入:nums = [], target = 0 输出:[-1,-1]
class Solution(object):
def searchRange(self, nums, target):
def search(nums, target):
global middle
left = 0
right = len(nums)
result = []
while left < right:
middle = int((right + left) / 2)
if nums[middle] < target:
left = middle + 1
elif nums[middle] > target:
right = middle
elif len(nums) == 1:
return [middle, middle]
else:
return middle
return -1
index = search(nums, target)
if index == -1:
return [-1, -1]
if len(nums) == 1 and nums[0] == target:
return [0, 0]
left, right = index, index
while left - 1 >= 0 and nums[left - 1] == target:
left -= 1
while right + 1 < len(nums) and nums[right + 1] == target:
right += 1
return [left, right]