题解 | #二分查找-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 # 若为空则直接返回-1 if not(nums): return -1 # 以两个端点作为low,high low = 0 high = len(nums) - 1 while low <= high: mid = int((low + high)/2) if nums[mid] == target: return mid elif nums[mid] > target: high = mid - 1 else: low = mid + 1 return -1