力扣https://leetcode.cn/problems/search-insert-position/考察二分查找
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
l = 0
r = len(nums - 1)
while l <= r:
mid = (l+r) // 2
if target == nums[mid]:
return mid
elif target > nums[mid]:
l = mid + 1
else:
r = mid - 1
return r