题解 | #二分查找-I#

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