👨‍💻 738LeetCode

Search Insert Position

Question

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.

Example

Input: [1,3,5,6], 5
Output: 2
Input: [1,3,5,6], 2
Output: 1
Input: [1,3,5,6], 7
Output: 4
Input: [1,3,5,6], 0
Output: 0

Solution

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