题解 | 二分查找-I

class Solution:
    def search(self , nums: List[int], target: int) -> int:
        if len(nums) == 0:
            return -1
        
        s = list(map(int,nums))
        n = len(s) 
        if target in s:
            for i in range(n):
                if s[i] == target:
                    return i
        else:
            return -1