Leetcode brush question record-35. Search insertion position

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