class Solution(object):
def search(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
left, right = 0, len(nums) - 1
while left <= right:
middle = left + (right - left) / 2
if nums[middle] == target:
return middle
elif nums[middle] < target:
left = middle + 1
else:
right = middle - 1
return -1
704-二分查找
最新推荐文章于 2026-06-21 17:05:31 发布
1087

被折叠的 条评论
为什么被折叠?



