class Solution:
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
# target 最大时
if target > nums[-1]:
nums.append (target)
return len(nums)-1
# 先判断存在否, 不存在时遇到比target大的数值直接塞进去
for i,n in enumerate(nums):
if n == target:
return i
elif n>target:
nums.insert(i,target)
return i