def left_bound(nums, target):
left, right = 0, len(nums)-1
while left < right:
mid = (left + right) // 2
if nums[mid] >= target:
right = mid
else:
left = mid + 1
return left
B
def left_bound(nums, target):
left, right = 0, len(nums)-1
while left <= right:
mid = (left + right) // 2
if nums[mid] >= target:
right = mid
else:
left = mid + 1
return right
C
def left_bound(nums, target):
left, right = 0, len(nums)-1
while left < right:
mid = (left + right) // 2
if nums[mid] < target:
left = mid
else:
right = mid - 1
return left
D
def left_bound(nums, target):
left, right = 0, len(nums)-1
while left <= right:
mid = (left + right) // 2
if nums[mid] > target:
right = mid - 1
else:
left = mid + 1
return left