Binary Search LeetCode solution in Python

1
# Runtime: 214 ms (Top 71.5%) | Memory: 17.81 MB (Top 65.3%)
2

3

4
class Solution:
5
    def search(self, nums: List[int], target: int) -> int:
6
        left = 0
7
        right = len(nums) - 1
8

9
        while left <= right:
10
            mid = (left + right) // 2
11
            if nums[mid] == target:
12
                return mid
13
            elif nums[mid] > target:
14
                right = mid - 1
15
            else:
16
                left = mid + 1
17

18
        return -1