与上一题一样的算法,这里不再赘述。
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
min,max = 0,len(nums)-1
while min <= max:
mid = (min + max) // 2
if nums[mid] == target:
return mid
if nums[mid] < target:
min = mid + 1
else:
max = mid -1
return max + 1