35. Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.

You may assume no duplicates in the array.

Here are few examples. [1,3,5,6], 5 → 2 [1,3,5,6], 2 → 1 [1,3,5,6], 7 → 4 [1,3,5,6], 0 → 0

Solution: Binary Search

class Solution(object):
    def searchInsert(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """

        def binary_search(low, high):
            if low > high:
                return low
            mid = low + (high - low) / 2
            if nums[mid] == target:
                return mid
            if nums[mid] < target:
                return binary_search(mid + 1, high)
            return binary_search(low, mid - 1)

        return binary_search(0, len(nums) - 1)

Related:

• 278. First Bad Version