给定一个排序数组和一个目标值,在数组中找到目标值,并返回其索引。如果目标值不存在于数组中,返回它将会被按顺序插入的位置。
你可以假设数组中无重复元素。
示例 1:
输入: [1,3,5,6], 5
输出: 2
示例 2:
输入: [1,3,5,6], 2
输出: 1
示例 3:
输入: [1,3,5,6], 7
输出: 4
示例 4:
输入: [1,3,5,6], 0
输出: 0
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/search-insert-position
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
class Solution(object):
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
left=0
right=len(nums)-1
l=left
r=right
if(left==right==0):
if(nums[0]>=target):
return 0
else:
return 1
while (left<right ):
mid=(left+right)//2
if(nums[mid]>target):
right=mid
r=mid
elif(nums[mid]<target):
left=mid+1
l=mid +1
elif(nums[mid]==target):
return mid
if(r!=len(nums)-1):
return r
elif(l!=0 and nums[len(nums)-1]>=target):
return l
else:
return len(nums)
class Solution(object):
def searchInsert(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: int
"""
left = 0
right = len(nums) - 1
while left <= right:
mid = left + (right - left) // 2
if nums[mid] == target:return mid
elif nums[mid] < target:
left = mid + 1
else:
right = mid - 1
return left
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:
mid = left + (right - left) // 2
if nums[mid] < target:
left = mid + 1
else:
right = mid
return left
这道题就是一个简单的二分查找题,难点主要在于边界条件的讨论。
大佬写的关于二分法的总结,写的不错分享下
https://leetcode-cn.com/problems/search-insert-position/solution/te-bie-hao-yong-de-er-fen-cha-fa-fa-mo-ban-python-/