题目地址:https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/
分开找左边界和右边界:
class Solution:
def searchRange(self, nums: List[int], target: int) -> List[int]:
res = [-1, -1]
if not nums: return res
if len(nums) == 1: return [0, 0] if nums[0] == target else [-1, -1]
l, r = 0, len(nums) - 1
while(l <= r):
mid = l + (r - l) // 2
if nums[mid] < target:
l = mid + 1
elif nums[mid] >= target:
r = mid - 1
l = -1 if (l >= len(nums) or nums[l] != target) else l
a, b = 0, len(nums) - 1
while(a <= b):
mid = a + (b - a) // 2
if nums[mid] <= target:
a = mid + 1
elif nums[mid] > target:
b = mid - 1
b = -1 if (b < 0 or nums[b] != target) else b
return [l, b]
labuladong二分法笔记
之前看负雪明烛推荐过labuladong,我就找了他的算法小抄(是叫这名儿吧?)来看,也关注了公众号。
觉得这篇写得很好,我读完之后的笔记如下:
一般要求时间复杂度为O(logN)
的题目就要考虑二分法。
二分法主要是解决在有序数组中搜索一个值、搜索左边界/右边界的问题。
1.搜索一个值的模板:
找得到就返回数组下标,找不到就返回-1
def BinarySearch(self, nums: List[int], target: int) -> int:
l, r = 0, len(nums) - 1
while l <= r: #小于等于
mid = l + (r - l) // 2 #防止溢出
if nums[mid] == target:
return mid
elif nums[mid] > target:
r = mid - 1 #因为mid已经检查过了,所以右边界r = mid - 1
elif nums[mid] < target:
l = mid +1
return -1
2.寻找左侧边界的模板:
找不到返回-1
def left_bound(self, nums: List[int], target: int) -> int:
l, r = 0, len(nums) - 1
while l <= r:
mid = l + (r - l) // 2
if nums[mid] < target:
l = mid + 1
elif nums[mid] > target:
r = mid - 1
elif nums[mid] == target:#因为是寻找边界,所以不急着返回,只是缩小右区间,
r = mid - 1 #最后在左侧区间里找到第一个等于target的值再返回它的索引
if (nums[l] != target or l >= len(nums)): #考虑越界
return -1
return l
3.寻找右侧边界的模板:
找不到返回-1
def right_bound(self, nums: List[int], target: int) -> int:
l, r = 0, len(nums) - 1
while l <= r:
mid = l + (r - l) // 2
if nums[mid] > target:
r = mid - 1
elif nums[mid] < target:
l = mid + 1
elif nums[mid] == target:
l = mid + 1
if (nums[r] != target or r < 0): #考虑越界
return -1
return r
以上三个模板中,因为搜索区间是左闭右闭,所以while l <=
r,退出while循环时l > r,所以要考虑越界问题; 因为mid已经检查过了,所以缩小区间时l = mid + 1
, r = mid - 1
。