class Solution(object):
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
left=0
right=len(nums)
while left<right:#二分法查找
middle=left+(right-left)/2
if nums[middle]>target:
right=middle
elif nums[middle]<target:
left=middle+1
else:
return middle
return right
python 力扣35数组搜索插入位置
最新推荐文章于 2021-03-07 15:30:43 发布