Leetcode: 35 - Search Insert Position

题目：

用python3来写代码：

class Solution:
    def searchInsert(self, nums: List[int], target: int) -> int:
        if len(nums) == 0:
            return 0
        for i in range(len(nums)):
            if nums[i] < target and i == len(nums)-1:  # The last one
                return i+1 
            elif nums[i] < target and target < nums[i+1]:  # 1 < 2 <3
                return i+1
            elif i == 0 and target < nums[i]:
                return i
            elif target == nums[i]:
                return i

这个思路写的很清楚，希望对大家有点帮助。

这里博主继续提供一些有用的知识点：

   # list
    for i in range(len(nums)):
        num = nums[i]
        ...
        
        
    for i, num in enumerate(nums):
        ...
        
    # dict
    memo = {
    
    0: 's', 1: 't', 2: 'z'}
    for key, val in memo.items():
        print(k, v)
        
        
    # set
    nums = [1,2,3,4,5,6,5,3,2]
    seen = set(nums)
    for key in seen:

如果觉得不错，就点赞或者关注或者留言~
谢谢~