[LeetCode] 704. Binary Search

Python

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        index =  bisect.bisect_left(nums, target)
        if index < len(nums) and nums[index] == target:
            return index
        else:
            return -1