Description
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. You must write an algorithm with O(log n) runtime complexity.
Examples
Input:
nums = [1,3,5,6], target = 5Output:
2Explanation:
5 is found at index 2.
Input:
nums = [1,3,5,6], target = 2Output:
1Explanation:
2 would be inserted at index 1.
Input:
nums = [1,3,5,6], target = 0Output:
0Explanation:
0 is smaller than all elements, so it would be inserted at the beginning at index 0.
Constraints
- •
1 ≤ nums.length ≤ 10⁴ - •
-10⁴ ≤ nums[i] ≤ 10⁴ - •
nums contains distinct values sorted in ascending order. - •
-10⁴ ≤ target ≤ 10⁴