题解 | #二分查找-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
if len(nums) == 0:
return -1
left = 0
right = len(nums) - 1
while left <= right:
mid = left + (right - left) // 2
print(mid)
if nums[mid] < target:
left = mid + 1
elif nums[mid] > target:
right = mid - 1
# print(left,right)
else:
return mid
return -1
实习算法题题解 文章被收录于专栏
实习算法题



查看2道真题和解析