35. Search Insert Position(Easy)

2,117次阅读
没有评论

共计 401 个字符,预计需要花费 2 分钟才能阅读完成。

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:

Input: [1,3,5,6], 5
Output: 2

Example 2:

Input: [1,3,5,6], 2
Output: 1

Example 3:

Input: [1,3,5,6], 7
Output: 4

Example 4:

Input: [1,3,5,6], 0
Output: 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)
正文完
请博主喝杯咖啡吧!
post-qrcode
 
admin
版权声明:本站原创文章,由 admin 2019-02-11发表,共计401字。
转载说明:除特殊说明外本站文章皆由CC-4.0协议发布,转载请注明出处。
评论(没有评论)
验证码