【Leetcode】二分法左侧边界右侧边界模板

在升序数组中找到目标值的索引：

输入: nums = [1,3,5,6], target = 5
输出: 2

class Solution:
    def searchTarget(self, nums: List[int], target: int) -> int:
        left = 0
        right = len(nums)-1

        while left<=right:
            mid = left + (right - left) // 2
            if nums[mid] == target:
                return mid
            elif nums[mid] > target:
                right = mid - 1
            else:
                left = mid + 1

在升序数组中找到目标值，如果没有目标值，返回插入位置索引：

输入: nums = [1,3,5,6], target = 2
输出: 1

class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        left = 0
        right = len(nums)-1

        while left<=right:
            mid = left + (right - left) // 2
            if nums[mid] == target:
                return mid
            elif nums[mid] > target:
                right = mid - 1
            else:
                left = mid + 1
        return left

在升序数组中找到目标值，返回左侧边界：

输入: nums = [1,3,3,3,3,5,6], target = 3
输出: 1

class Solution:
    def searchRange(self, nums, target):
        left = 0
        right = len(nums)-1
        
        while(left<=right):
            mid = left + (right-left)//2
            if nums[mid] == target:
                right = mid - 1
            elif nums[mid] > target:
                right = mid - 1
            else:
                left = mid + 1
        if left>=len(nums) or nums[left]!=target:
            return -1
        return left

在升序数组中找到目标值，返回右侧边界：

输入: nums = [1,3,3,3,3,5,6], target = 3
输出: 4

class Solution:
    def searchRightBound(self, nums, target):
        left = 0
        right = len(nums)-1
        
        while(left<=right):
            mid = left + (right-left)//2
            if nums[mid] == target:
                left = mid + 1
            elif nums[mid] > target:
                right = mid - 1
            else:
                left = mid + 1
        if nums[right]!=target or right>len(nums)-1:
            return -1
        return right 

在升序数组中找到目标值，同时返回左右侧边界：

输入：nums = [5,7,7,8,8,10], target = 8
输出：[3,4]

class Solution:
    def searchRange(self, nums: List[int], target: int) -> List[int]:
        left = 0
        right = len(nums)-1
        res = [0,0]
        
        if target not in nums:
            return [-1,-1]

        # 寻找左侧边界
        while(left<=right):
            mid = left + (right-left)//2
            if nums[mid] == target:
                right = mid - 1
            elif nums[mid] > target:
                right = mid - 1
            else:
                left = mid + 1
        if left>=len(nums) or nums[left]!=target:
            res[0] = -1
        res[0] = left

        # 寻找右侧边界
        right = len(nums)-1
        while left<=right:
            mid = left+(right-left)//2
            if nums[mid]==target:
                left = mid + 1
            elif nums[mid]>target:
                right = mid - 1
            else:
                left = mid + 1
        if right<0 or nums[right]!=target:
            res[1] = -1
        res[1] = right

        return res

猜你喜欢：👇🏻
⭐【Leetcode】大神总结的所有TopK问题模板（基于快速排序）
⭐【Leetcode】岛屿问题（数量，周长，面积）
⭐【Leetcode】背包问题模板