LeetCode 704 - 二分查找

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