class Solution:
def search(self, nums: List[int], target: int) -> int:
return self.func(0,len(nums)-1,nums,target)
def func(self,start,end,nums,target):
while start < end:
mid = start +((end-start)>>1)
if nums[mid] == target:
return mid
elif nums[mid] > target:
end = mid - 1
elif nums[mid] < target:
start = mid + 1
if start == end and nums[start] == target:
return start
else:
return -1
Leetcode刷题记录——704. 二分查找
最新推荐文章于 2024-06-11 10:11:48 发布