704. Binary Search

링크

 

from bisect import bisect_left, bisect_right
class Solution:
    def search(self, nums: List[int], target: int) -> int:
        
        for i in range(len(nums)):
            numindex = bisect_left(nums, nums[i])
            if target == nums[i] :
                return i
            
        return -1