Search Insert Position
Easy
Array
Binary Search
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. You must write an algorithm with O(log n) runtime complexity.
Examples:
Input:
[[1,3,5,6],5]Output:
2Input:
[[1,3,5,6],2]Output:
1Input:
[[1,3,5,6],7]Output:
4Constraints:
- 1 ≤ nums.length ≤ 10⁴
- -10⁴ ≤ nums[i] ≤ 10⁴
- nums contains distinct values sorted in ascending order.
- -10⁴ ≤ target ≤ 10⁴
Code Editor
Loading advanced editor...
Console Output
Ready to execute
Click "Run Code" to see your output here