Search Insert Position
EasyAcceptance Rate 43.5%
Given a sorted array of distinct integers 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.
Examples
Example 1
Input
nums = [1,3,5,6], target = 5
Output
2
Constraints
1 <= nums.length <= 10^4-10^4 <= nums[i] <= 10^4-10^4 <= target <= 10^4