Source: Search Insert Position - LeetCode
状态转移方程
题解
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
left,right=0,len(nums)-1
while left<=right:
mid=left+(right-left)//2
if nums[mid]>target:right=mid-1
elif nums[mid]<target:left=mid+1
else:return mid
return left