35. Search Insert Position(Easy)

831次阅读
没有评论

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Example 1:

<strong>Input:</strong> [1,3,5,6], 5
<strong>Output:</strong> 2

Example 2:

<strong>Input:</strong> [1,3,5,6], 2
<strong>Output:</strong> 1

Example 3:

<strong>Input:</strong> [1,3,5,6], 7
<strong>Output:</strong> 4

Example 4:

<strong>Input:</strong> [1,3,5,6], 0
<strong>Output:</strong> 0

解法

class Solution:
    def searchInsert(self, nums: 'List[int]', target: 'int') -> 'int':
        for x in range(len(nums)):
            if target<=nums[x]:
                return x
        
        return len(nums)
admin
版权声明:本站原创文章,由admin2019-02-11发表,共计401字。
转载提示:除特殊说明外本站文章皆由CC-4.0协议发布,转载请注明出处。
评论(没有评论)