二分搜索的三种形态

二分搜索的三种形态：

• 寻找最中间那个数（若最中间的数有奇数个，则寻找最中间那个；若为偶数个，则寻找中间线靠左的那个）；
• 寻找左侧边界；
• 寻找右侧边界。

代码如下：

class BinarySearch(object):
	# 寻找最中间那个数
    def vanillaBS(self, nums, target):
        lo, hi = 0, len(nums)-1
        while lo <= hi:
            mid = lo + (hi - lo) // 2
            if nums[mid] == target:
                return mid
            elif nums[mid] < target:
                lo = mid + 1
            else:
                hi = mid - 1
        
        return -1
	
	# 寻找左侧边界
    def leftBS(self, nums, target):
        lo, hi = 0, len(nums)
        while lo < hi:
            mid = lo + (hi - lo) // 2
            if nums[mid] == target:
                hi = mid
            elif nums[mid] < target:
                lo = mid + 1
            else:
                hi = mid
        
        return lo

	# 寻找右侧边界
    def rightBS(self, nums, target):
        lo, hi = 0, len(nums)
        while lo < hi:
            mid = lo + (hi - lo) // 2
            if nums[mid] == target:
                lo = mid + 1
            elif nums[mid] < target:
                lo = mid + 1
            else:
                hi = mid
        
        return lo - 1


if __name__ == '__main__':
    bs = BinarySearch()
    nums = [1, 3, 4, 4, 4, 4, 6, 7]
    target = 4
    vidx = bs.vanillaBS(nums, target)
    print(f'vidx = {vidx}, vres = {nums[vidx]}')
    left_idx = bs.leftBS(nums, target)
    print(f'left_idx = {left_idx}, left_res = {nums[left_idx]}')
    right_idx = bs.rightBS(nums, target)
    print(f'right_idx = {right_idx}, right_res = {nums[right_idx]}')

调试结果：

vidx = 3, vres = 4
left_idx = 2, left_res = 4
right_idx = 5, right_res = 4

图示如下：

                  |
 idx: 0, 1, 2, 3, | 4, 5, 6, 7
nums: 1, 3, 4, 4, | 4, 4, 6, 7
                  |