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.
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
Your code:
Def searchInsert(nums, target):
Left, right = 0, len(nums) - 1
While left <= right:
Mid = (left + right) //2
if nums[mid] == target:
Return mid
elif nums[mid] < target:
left= mid + 1
else :
right = mid - 1
Return left
