Search Insert Position

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. ### Constraints - `1 <= nums.length <= 10^4` - `-10^4 <= nums[i], target <= 10^4` - `nums` contains **distinct** values sorted in ascending order. ### Input Format First line contains the target integer. Second line contains space-separated integers representing `nums`. ### Output Format Print the index where `target` is found or should be inserted.