题解 | #二分查找-I#
二分查找-I
https://www.nowcoder.com/practice/d3df40bd23594118b57554129cadf47b
#
# 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
#
#
# @param nums int整型一维数组
# @param target int整型
# @return int整型
#
class Solution:
def search(self , nums: List[int], target: int) -> int:
# write code here
left = 0
right = len(nums)
if right == left:
return -1
while right-left>1:
mid = (right-left)//2
if target > nums[left+mid]:
left += mid
elif target == nums[left+mid]:
return left+mid
else:
right -= mid
if target == nums[left]:return left
elif target == nums[right-1]:return right
return -1
查看22道真题和解析