704. Binary Search - LeetCode

class Solution:
    def search(self, nums: list[int], target: int) -> int:
        l, r = 0, len(nums)
        while l < r:
            m = (l + r) // 2
            if nums[m] == target:
                return m
            l, r = (l, m) if nums[m] > target else (m + 1, r)
        return -1