在升序數(shù)組中找到目標(biāo)值的索引：

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

class Solution:def searchTarget(self, nums: List[int], target: int) -> int:left = 0right = len(nums)-1while left<=right:mid = left + (right - left) // 2if nums[mid] == target:return midelif nums[mid] > target:right = mid - 1else:left = mid + 1

在升序數(shù)組中找到目標(biāo)值，如果沒有目標(biāo)值，返回插入位置索引：

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

class Solution:def searchInsert(self, nums: List[int], target: int) -> int:left = 0right = len(nums)-1while left<=right:mid = left + (right - left) // 2if nums[mid] == target:return midelif nums[mid] > target:right = mid - 1else:left = mid + 1return left

在升序數(shù)組中找到目標(biāo)值，返回左側(cè)邊界：

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

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

在升序數(shù)組中找到目標(biāo)值，返回右側(cè)邊界：

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

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

在升序數(shù)組中找到目標(biāo)值，同時返回左右側(cè)邊界：

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

class Solution:def searchRange(self, nums: List[int], target: int) -> List[int]:left = 0right = len(nums)-1res = [0,0]if target not in nums:return [-1,-1]# 尋找左側(cè)邊界while(left<=right):mid = left + (right-left)//2if nums[mid] == target:right = mid - 1elif nums[mid] > target:right = mid - 1else:left = mid + 1if left>=len(nums) or nums[left]!=target:res[0] = -1res[0] = left# 尋找右側(cè)邊界right = len(nums)-1while left<=right:mid = left+(right-left)//2if nums[mid]==target:left = mid + 1elif nums[mid]>target:right = mid - 1else:left = mid + 1if right<0 or nums[right]!=target:res[1] = -1res[1] = rightreturn res

猜你喜歡：👇🏻
?【Leetcode】大神總結(jié)的所有TopK問題模板（基于快速排序）
?【Leetcode】島嶼問題（數(shù)量，周長，面積）
?【Leetcode】背包問題模板

總結(jié)

以上是生活随笔為你收集整理的【Leetcode】二分法左侧边界右侧边界模板的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。