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
Example 4:
Input: nums = [1,3,5,6], target = 0 Output: 0
Example 5:
Input: nums = [1], target = 0 Output: 0
Constraints:
1 <= nums.length <= 104-104 <= nums[i] <= 104nums contains distinct values sorted in ascending order.-104 <= target <= 104Source
def search_insert(nums, target):
pass
nums = [1, 3, 5, 6]
target = 5
search_insert(nums, target)
nums = [1, 3, 5, 6]
target = 2
search_insert(nums, target)
nums = [1, 3, 5, 6]
target = 7
search_insert(nums, target)
nums = [1, 3, 5, 6]
target = 0
search_insert(nums, target)
nums = [1]
target = 0
search_insert(nums, target)
nums = []
target = 10
search_insert(nums, target)
Can you solve it both iteratively and recursively?
def search_insert(nums, target):
pass