原题目:力扣
代码:
class Solution(object):
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
i = 0
if len(nums) == 1 and target > nums[0]:
return 1
if len(nums) == 1 and target < nums[0]:
return 0
while i < len(nums):
if nums[i] == target:
return i
if nums[i] < target and nums[i + 1] > target:
return i + 1
if nums[-1] < target:
return len(nums)
if nums[0] > target:
return 0
else:
i = i + 1