二分法实现搜索插入 def searchInsert(self, nums: List[int], target: int) -> int: if not nums: return 0 l = 0 r = len(nums) - 1 while l <= r: mid = (l+r) >> 1 if nums[mid] == target: return mid elif nums[mid] > target: r = mid - 1 else: l = mid + 1 return r+1