704. Binary Search二分查找
2020-07-15 本文已影响0人
羲牧
class Solution:
def search(self, nums: List[int], target: int) -> int:
left = 0
right = len(nums) -1
while left <= right:
mid = left + ((right-left)>>2)
if nums[mid] == target:
return mid
elif nums[mid] > target:
right = mid - 1
else:
left = mid + 1
return -1
