class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
if not nums:return 0
left = 0
length = len(nums)
right = len(nums) - 1
while left < right:
mid = (left + right) // 2
if nums[mid] == target:
return mid
elif nums[mid] < target:
left = mid + 1
else:
right = mid
return left if target <= nums[-1] else (left + 1)
与上一题类似