考察二分查找的应用
卡在了对于长度为1的数组处理上
题目描述
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
low = 0
high = len(nums)
mid = (low + high) // 2
while low < mid:
if nums[mid] == target:
return mid
elif nums[mid] < target:
low = mid
else:
high = mid
mid = (low + high) // 2
if nums[low]<target:
return low+1
else:
return low