Solution: Search Insert Position
Understand how to apply modified binary search to find the index of a target value or the correct insertion point in a sorted array of distinct integers. This lesson guides you through using pointers and midpoint calculations to achieve an optimal O(log n) time solution and maintain sorted order.
We'll cover the following...
We'll cover the following...
Statement
Given a sorted array of distinct integers, nums, and an integer, target, return the index of target if it exists in the array.
If the target is not present, return the index where it should be inserted to maintain the sorted order.
Your algorithm must run in the
Constraints:
nums.length...