1
2
3
4
5
6
7
8
9
10
11
12
13
14
| class Solution:
def search(self, nums: List[int], target: int) -> int:
l, r, m = 0, len(nums)-1, len(nums)//2
while l <= r:
m = (r+l)//2
print(f"{l=},{r=},{m=}")
if nums[m] == target:
return m
else:
if nums[m] < target:
l = m + 1
else:
r = m - 1
return -1
|