New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

704. Binary Search #57

Open

jrmullen opened this issue Jul 26, 2023 · 0 comments

Owner

jrmullen commented Jul 26, 2023

class Solution:
    def search(self, nums: List[int], target: int) -> int:
        l, r = 0, len(nums) - 1

        while l <= r:
            m = (r + l) // 2  # Divide to the nearest whole integer

            if nums[m] < target:
                l = m + 1
            elif nums[m] > target:
                r = m - 1
            else:
                return m
        return -1

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment