题解 | #二分查找-I#

class Solution:
    def search(self,nums,target):
        left=0 #左指针初始索引为0
        right=len(nums)-1 #右指针初始索引为数组长度减一
        while left<=right:
            mid=(left+right)//2
            if target>nums[mid]:
                left=mid+1
            elif target<nums[mid]:
                right=mid-1
            else:
                return mid
        return -1