【leetcode】704二分查找

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        l, r, m = 0, len(nums)-1, len(nums)//2
        while l <= r:
            m = (r+l)//2
            if nums[m] == target:
                return m
            else:
                if nums[m] < target:
                    l = m + 1 
                else:
                    r = m - 1
        return -1