Search Insert Position
Easy
Topics
Given a sorted array of distinct integers nums and a target, return the index if found. If not, return the index where it would be inserted to keep the array sorted. O(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
Constraints
- 1 <= nums.length <= 10^4
- nums is sorted ascending with distinct values.
Run ⌘' · Submit ⌘⏎
SensAI