在排序数组中查找元素的第一个和最后一个位置
给定一个按照升序排列的整数数组 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]
提示:
0 <= nums.length <= 105
-109 <= nums[i] <= 109
nums 是一个非递减数组
-109 <= target <= 109
题解
class Solution:
def searchRange(self, nums: List[int], target: int) -> List[int]:
length = len(nums)
first = 0
last = length - 1
retult_list = [-1, -1]
while last >= first:
mid = first + (last - first) // 2
if nums[mid] == target:
before_mid = mid
while before_mid > 0 and nums[before_mid-1] == target:
before_mid -= 1
retult_list[0] = before_mid
after_mid = mid
while after_mid + 1 < length and nums[after_mid+1] == target:
after_mid += 1
retult_list[1] = after_mid
return retult_list
elif nums[mid] > target:
last = mid - 1
else:
first = mid + 1
return retult_list