class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
i = 0
while i < len(nums) and target > nums[i]:
i += 1
return i
class Solution:
def searchInsert(self, nums: List[int], target: int) -> int:
l, h = 0, len(nums)
while l < h:
mid = l + (h-l) // 2
if target > nums[mid]:
l = mid + 1
elif target < nums[mid]:
h = mid
else:
return mid
return l