题目:https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/
给定一个按照升序排列的整数数组 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
解题思路:
复杂度要求log级且序列有序,优先考虑二分查找,由于此题要求寻找区间不同于普通二分查找找固定值,相当于走两遍二分,分别找区间的左边界和右边界,即找第一个小于target的地方+1,第一个大于target的地方-1,注意边界判断即可。
class Solution:
def searchRange(self, nums: List[int], target: int) -> List[int]:
res = []
if(len(nums) ==0):
return [-1,-1]
right = self.findRight(nums, target)
if(right != -1):
left = self.findLeft(nums, target)
if(left <= right):
res.append(left)
res.append(right)
else:
res.append(-1)
res.append(-1)
else:
res.append(-1)
res.append(-1)
return res
def findRight(self, nums, target):
start = 0
end = len(nums) - 1
key = -1
while(start<=end):
mid = start + (end - start) // 2
if(nums[mid] <= target):
start = mid + 1
elif(nums[mid] > target):
end = mid - 1
key = mid
if(nums[end] == target):
return end
else:
return key - 1
def findLeft(self, nums, target):
start = 0
end = len(nums) - 1
key = len(nums)
while(start<=end):
mid = start + (end - start) // 2
if(nums[mid] < target):
start = mid + 1
elif(nums[mid] >= target):
end = mid - 1
if(mid < key):
key = mid
if(key == len(nums)):
return -1
else:
return key
耗时44ms
测试用例:
if __name__ == "__main__":
nums = []
target = 0
res = Solution().searchRange(nums, target)
print(res)