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. 搜索插入位置
最新推荐文章于 2022-10-08 20:18:36 发布