【题目解析】
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
if target < nums[0]:
return 0
elif target > nums[-1]:
return len(nums)
l = 0
r = len(nums) - 1
mid = l + (r-l+1) // 2
tag = "None"
while l <= r:
if nums[mid] == target:
tag = mid
return mid
if nums[mid] > target:
r = mid - 1
else:
l = mid + 1
mid = l + (r-l+1) // 2
if tag == "None":
return mid