Given a sorted array of distinct integers nums and a target, return the index of target if it's there. If it isn't, return the index where it would be inserted to keep the array sorted.
Aim for O(log n) time.
Examples
Example 1
- Input
- nums = [1, 3, 5, 6], target = 5
- Output
- 2
Example 2
- Input
- nums = [1, 3, 5, 6], target = 2
- Output
- 1
- Why
- 2 isn't there; it would go between 1 and 3.
Example 3
- Input
- nums = [1, 3, 5, 6], target = 7
- Output
- 4
Constraints
1 <= nums.length <= 10^4-10^4 <= nums[i], target <= 10^4numshas distinct values, sorted in ascending order.