LC 0714 [E] Binary Search - ALawliet/algorithms GitHub Wiki
class Solution:
def search(self, A: List[int], T: int) -> int:
l = 0
r = len(A) - 1
while l <= r:
m = (l + r) // 2
if A[m] == T:
return m
elif A[m] < T:
l = m + 1
elif A[m] > T:
r = m - 1
return -1