Leetcode # 35. Search Insert Position

https://leetcode.com/problems/search-insert-position/

Solution

Time Complexity: O(log(len(nums)))
Space Complexity: O(1)

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

Last Updated on 2023/08/16 by A1go