classSolution:defsearchInsert(self, nums: List[int], target:int)->int:
length =len(nums)
first =0
last = length -1while last >= first:
mid = first +(last - first)//2if nums[mid]== target:return mid
elif nums[mid]> target:
last = mid -1else:
first = mid +1# 特殊情况处理return first if first < length else length