34. Find First and Last Position of Element in Sorted Array-二分搜索

题目

题目链接

思路

根据二分搜索模板，只需要修改一下条件即可

1. 判断往哪边搜索
2. 判断是否刚好满足条件

代码

class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        low = 0
        high = len(nums) - 1
        lower_bound = self.search_lower_bound(nums, target, low, high)
        upper_bound = self.search_upper_bound(nums, target, low, high)
        return [lower_bound, upper_bound]
        
	def search_lower_bound(nums, target, low, high):
	    if low > high:
	        return -1
	
	    middle = low + int((high - low) / 2)
	
	    # 与模板的差异只在判断条件
	    if nums[middle] == target and (middle == 0 or nums[middle - 1] < target):
	        return middle
	
	    if target <= nums[middle]:
	        return search_lower_bound(nums, target, low, middle - 1)
	    return search_lower_bound(nums, target, middle + 1, high)
	
	
	def search_upper_bound(nums, target, low, high):
	    if low > high:
	        return -1
	
	    middle = low + int((high - low) / 2)
	
	    if nums[middle] == target and (middle == len(nums) - 1 or nums[middle + 1] > target):
	        return middle
	
	    if target <= nums[middle]:
	        return search_upper_bound(nums, target, low, middle - 1)
	    return search_upper_bound(nums, target, middle + 1, high)