704. Binary Search刷题笔记

题目描述
注意list的切片索引是左闭右开
这个用递归没办法处理没搜索到时候的-1，但是用迭代就很方便

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        low = 0
        high = len(nums)
        while high>low:
            mid = (high+low)//2
            if nums[mid] == target:
                return mid
            elif nums[mid] > target:
                high = mid
            else:
                low = mid+1
        return -1

运行结果：