35. Search Insert Position python3

最新推荐文章于 2022-08-08 17:51:50 发布

原创最新推荐文章于 2022-08-08 17:51:50 发布 · 248 阅读

0 ·

CC 4.0 BY-SA版权

本文详细解析了在已排序数组中查找目标值的插入位置的算法。通过两种方法实现：遍历查找和二分法查找，后者效率更高，适用于大数据量场景。文章提供了Python代码示例，帮助读者理解算法原理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

35. Search Insert Position

Easy

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

解答1：

class Solution:
def searchInsert(self, nums, target) :
"""
:type nums:List[int]
:type target:int
:rtype :int
"""
if len(nums)==0:
return 0
for i in range(len(nums)):
if target <= nums[i]:
return i;
return len(nums)

解答2：二分法查找

class Solution:
def searchInsert(self, nums, target) :
"""
:type nums:List[int]
:type target:int
:rtype :int
"""
if len(nums)==0:
return 0
left=0
right=len(nums)-1
while(left<=right):
middle=int((left+right)/2)
if (target==nums[middle]):
return middle
elif (target>nums[middle]):
left=middle+1
else:
right=middle-1
return left