题解 | 二分查找-I

#
# 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
#
# 
# @param nums int整型一维数组 
# @param target int整型 
# @return int整型
# 二分查找方法
class Solution:
    def search(self , nums: List[int], target: int) -> int:
        # write code here
        if not nums: return -1
        left = 0
        right = len(nums)-1
        while left <= right:
            mid = (left+right)//2
            if target == nums[mid]:
                return mid
            elif target > nums[mid]:
                left = mid + 1
            else:
                right = mid - 1
        return -1