14 lines
374 B
Python
14 lines
374 B
Python
class Solution:
|
|
def search(self, nums: list[int], target: int) -> int:
|
|
lo, hi = 0, len(nums) - 1
|
|
i = (hi - lo) // 2
|
|
while lo <= hi:
|
|
i = (lo + hi) // 2
|
|
if nums[i] < target:
|
|
lo = i + 1
|
|
elif nums[i] > target:
|
|
hi = i - 1
|
|
else:
|
|
return i
|
|
return -1
|