Search Insert Position

Search Insert Position

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

You must write an algorithm with O(log n) runtime complexity.

Examples

Example 1:

Input: nums = [1, 3, 5, 6], target = 5
Output: 2
Explanation: 5 is found at index 2.

Example 2:

Input: nums = [1, 3, 5, 6], target = 2
Output: 1
Explanation: 2 would be inserted at index 1 (between 1 and 3).

Example 3:

Input: nums = [1, 3, 5, 6], target = 7
Output: 4
Explanation: 7 would be inserted at the end.

Example 4:

Input: nums = [1, 3, 5, 6], target = 0
Output: 0
Explanation: 0 would be inserted at the beginning.

Constraints

• 1 <= nums.length <= 10^4
• -10^4 <= nums[i] <= 10^4
• nums contains distinct values sorted in ascending order.
• -10^4 <= target <= 10^4

Expected Complexity

• Time: O(log n)
• Space: O(1)