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
Yout must write an algoritham with 0(log n)
Example 1:
Input: nums = [1,3,5,6], target = 5 Output: 2 Example 2: Input: nums = [1,3,5,6], target = 2 Output: 1 Example 3: Input: nums = [1,3,5,6], target = 7 Output: 4
Leetcode link: https://leetcode.com/problems/search-insert-position/
