二分查找可插入的第一个位置
left返回的是可插入的前一个位置下标
nums= [1,2,3,5,5]
x=3
left, right = 0, len(nums)-1
while left < right:
mid = (right +1+left) // 2
if nums[mid] < x:
left = mid
else:
right = mid - 1
print(left)
left = 1

二分查找可插入的第一个位置
left返回的是可插入的前一个位置下标
nums= [1,2,3,5,5]
x=3
left, right = 0, len(nums)-1
while left < right:
mid = (right +1+left) // 2
if nums[mid] < x:
left = mid
else:
right = mid - 1
print(left)
left = 1