Search Insert Position
EasyP2Coding
Given a sorted array nums of distinct integers and a target, return the index of target if it is present. Otherwise return the index where it would have to be inserted to keep the array sorted.
Your solution must run in O(log n) time.
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
Constraints
- 1 <= nums.length <= 10^4
- -10^4 <= nums[i], target <= 10^4
- nums is sorted ascending with distinct values
Hints
Give it a real attempt first. Run shows which examples fail.
Saved automatically
Run checks the 3 visible tests, Submit all 11. ⌘Enter runs, ⌘⇧Enter submits.