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.<\/p>\n\n\n\n
You must write an algorithm with Here’s the [Problem Link<\/span><\/mark><\/a><\/strong>] to begin with.<\/p>\n\n\n\n Example 1:<\/strong><\/p>\n\n\n\n Example 2:<\/strong><\/p>\n\n\n\n Example 3:<\/strong><\/p>\n\n\n\n Constraints:<\/strong><\/p>\n\n\n\n Walk the array from left to right.<\/p>\n\n\n\nO(log n)<\/code> runtime complexity.<\/p>\n\n\n\nInput:<\/strong> nums = [1,3,5,6], target = 5
Output:<\/strong> 2<\/pre>\n\n\n\nInput:<\/strong> nums = [1,3,5,6], target = 2
Output:<\/strong> 1<\/pre>\n\n\n\nInput:<\/strong> nums = [1,3,5,6], target = 7
Output:<\/strong> 4<\/pre>\n\n\n\n\n
1 <= nums.length <= 104<\/sup><\/code><\/li>\n\n\n\n-104<\/sup> <= nums[i] <= 104<\/sup><\/code><\/li>\n\n\n\nnums<\/code>\u00a0contains\u00a0distinct<\/strong>\u00a0values sorted in\u00a0ascending<\/strong>\u00a0order.<\/li>\n\n\n\n-104<\/sup> <= target <= 104<\/sup><\/code><\/li>\n<\/ul>\n\n\n
\n\n\n\nBrute Force Solution (Linear Scan)<\/h2>\n\n\n\n
Intuition & Approach<\/h3>\n\n\n\n
\n
target<\/code><\/strong>, return its index.<\/li>\n\n\n\ntarget<\/code> belongs at the end, so return len(nums)<\/code>.<\/li>\n<\/ul>\n\n\n\nCode Implementation<\/h3>\n\n\n\n