class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
#nums = [target - 1] + nums
res = -1
for i,value in enumerate(nums):
if value >= target:
res = i
break
if res == -1:
res = len(nums)
return res
Leetcode刷题记录——35. 搜索插入位置
猜你喜欢
转载自blog.csdn.net/weixin_41545780/article/details/105479129
今日推荐
周排行