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 $O(\log n)$ time.

Constraints:

• $1 \leq$ nums.length $\leq 10^3$ ...