LC-0035 Easy LeetCode

35. Search Insert Position

Read the full problem statement on LeetCode.

Difficulty: easy Acceptance: 49% Topics: Array, Binary Search

Reading material

Arrays & Hashing 12 min Binary Search 12 min

Reference solution (spoiler · python)

# Time:  O(logn)
# Space: O(1)

class Solution(object):
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        left, right = 0, len(nums) - 1
        while left <= right:
            mid = left + (right - left) / 2
            if nums[mid] >= target:
                right = mid - 1
            else:
                left = mid + 1

        return left

Solution from kamyu104/LeetCode-Solutions · MIT