Very simple python solution


  • 0
    N
        def searchInsert(self, nums, target):
            for x in xrange(len(nums)):
                if nums[x] >= target:
                    return x
            return x+1
    

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.