Binary Search - New Way

bsearch.py

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        n = len(nums)
        lo, hi = 0, n - 1
        while hi - lo > 1 :
            mid = (lo + hi)//2
            if nums[mid] < target :
                lo = mid + 1
            else:
                hi = mid 
        
        if nums[lo] == target : return lo 
        elif nums[hi] == target : return hi 
        return -1