leetcode 链接:https://leetcode-cn.com/problems/search-insert-position/
python:24ms, 10.9MB, 99%
class Solution(object):
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
i = -1
for i in range(len(nums)):
if nums[i] >= target: return i
return i + 1
其他方法看 leetcode 链接 评论区~