1.思路:先判断是否在数组中,若在,则查找相等的;若不在则找到大于target值得位置则返回,否则返回数组的长度值
2.代码:
class Solution:
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
if target in nums:
return nums.index(target)
else:
for i in range(len(nums)):
if nums[i]>target:
return i
return len(nums)