1
class Solution:
2
    def searchInsert(self, nums, target):
3
        for i, num in enumerate(nums):
4
            if num >= target:
5
                return i
6
        return len(nums)