[LEEDCode][035][简单] – 搜索插入位置（search-insert-position）

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.

给定一个排序数组和一个目标值，在数组中找到目标值，并返回其索引。如果目标值不存在于数组中，返回它将会被按顺序插入的位置。

你可以假设数组中无重复元素。

示例 1:

<strong>输入:</strong> [1,3,5,6], 5
<strong>输出:</strong> 2

1 2	<strong>输入:</strong> [1,3,5,6], 5 <strong>输出:</strong> 2

示例 2:

<strong>输入:</strong> [1,3,5,6], 2
<strong>输出:</strong> 1

1 2	<strong>输入:</strong> [1,3,5,6], 2 <strong>输出:</strong> 1

示例 3:

<strong>输入:</strong> [1,3,5,6], 7
<strong>输出:</strong> 4

1 2	<strong>输入:</strong> [1,3,5,6], 7 <strong>输出:</strong> 4

示例 4:

<strong>输入:</strong> [1,3,5,6], 0
<strong>输出:</strong> 0

1 2	<strong>输入:</strong> [1,3,5,6], 0 <strong>输出:</strong> 0

解答

class Solution:
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        for i in range(len(nums)):
            if target > nums[-1]:
                return len(nums)
            elif target > nums[i]:
                continue
            else:
                return i

class Solution:

def searchInsert(self, nums, target):

"""

:type nums: List[int]

:type target: int

:rtype: int

"""

for i in range(len(nums)):

if target > nums[-1]:

return len(nums)

elif target > nums[i]:

continue

else:

return i

自测用例

try:
    nums = [1, 3, 5, 6]
    target = 5
    result_1 = 2
    result_2 = Solution().searchInsert(nums, target)
    print('{} - {}'.format(result_1, result_2))
except Exception as e:
    print(e)


try:
    nums = [1,3,5,6]
    target = 2
    result_1 = 1
    result_2 = Solution().searchInsert(nums, target)
    print('{} - {}'.format(result_1, result_2))
except Exception as e:
    print(e)


try:
    nums = [1,3,5,6]
    target = 7
    result_1 = 4
    result_2 = Solution().searchInsert(nums, target)
    print('{} - {}'.format(result_1, result_2))
except Exception as e:
    print(e)


try:
    nums = [1,3,5,6]
    target = 0
    result_1 = 0
    result_2 = Solution().searchInsert(nums, target)
    print('{} - {}'.format(result_1, result_2))
except Exception as e:
    print(e)

try:

nums = [1, 3, 5, 6]

target = 5

result_1 = 2

result_2 = Solution().searchInsert(nums, target)

print('{} - {}'.format(result_1, result_2))

except Exception as e:

print(e)

try:

nums = [1,3,5,6]

target = 2

result_1 = 1

result_2 = Solution().searchInsert(nums, target)

print('{} - {}'.format(result_1, result_2))

except Exception as e:

print(e)

try:

nums = [1,3,5,6]

target = 7

result_1 = 4

result_2 = Solution().searchInsert(nums, target)

print('{} - {}'.format(result_1, result_2))

except Exception as e:

print(e)

try:

nums = [1,3,5,6]

target = 0

result_1 = 0

result_2 = Solution().searchInsert(nums, target)

print('{} - {}'.format(result_1, result_2))

except Exception as e:

print(e)

运行结果

提交时间	状态	执行用时	语言
几秒前	通过	52 ms	python3

解答

自测用例

运行结果

Hi，您需要填写昵称和邮箱！