二分查找左右边界

https://leetcode-cn.com/problems/find-first-and-last-position-of-element-in-sorted-array/solution/er-fen-cha-zhao-suan-fa-xi-jie-xiang-jie-by-labula/

def left_erfen(nums, target):
    l = 0
    r = len(nums)
    while (l < r):
        mid = (l + r) // 2
        if nums[mid] >= target:
            r = mid
        else:
            l = mid + 1
    return l

def right_rerfen(nums, target):
    l = 0
    r = len(nums)
    while(l < r):
        mid = (l + r) // 2
        if nums[mid] <= target:
            l = mid + 1
        else:
            r = mid
    return l - 1

nums = [3, 4, 4, 4, 5, 6]
print (left_erfen(nums, 4))

print "r"

print (right_rerfen(nums, 4))





1
r
3

Process finished with exit code 0