二分搜索详解

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13

def binary_search(nums):
    l, r = 0, len(nums)
    while l < r:
        mid = l + (r - l) // 2
        if 找到:
            l = mid + 1
        elif 需要向右搜索:
            l = mid + 1
        elif 需要向左搜索:
            r = mid
    if l == len(nums):
        return
    return nums[l]