python二分法模板

Xcodd

已于 2023-02-11 19:52:57 修改

阅读量179

点赞数

分类专栏：笔记文章标签：算法 leetcode 职场和发展

于 2023-02-11 19:06:11 首次发布

本文链接：https://blog.csdn.net/Xcodd/article/details/128986990

版权

笔记专栏收录该内容

12 篇文章 1 订阅

订阅专栏

python二分法模板


def searchLeft(i,j,nums,target):
    while i<=j:
        mid = (i+j)>>1
        if target<=nums[mid]:
            j = mid-1
        else:
            i = mid+1
    if  i>=len(nums) or nums[i] != target:
        return -1
    return i

def searchRight(i,j,nums,target):
    while i<=j:
        mid = (i+j)>>1
        if target < nums[mid]:
            j = mid-1
        else:
            i = mid+1
    if j<0 or nums[j] != target:
        return -1
    return j
class Solution(object):
    def searchRange(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: List[int]
        """
        i = 0
        j = len(nums)-1
        return [searchLeft(i,j,nums,target),searchRight(i,j,nums,target)]