search-insert-position

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

Algorithms

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&nbsp;write an algorithm with&nbsp;<code>O(log n)</code> runtime complexity.

&nbsp;
Example 1:

<pre>
Input: nums = [1,3,5,6], target = 5
Output: 2
</pre>

Example 2:

<pre>
Input: nums = [1,3,5,6], target = 2
Output: 1
</pre>

Example 3:

<pre>
Input: nums = [1,3,5,6], target = 7
Output: 4
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 104</code></li>
	<li><code>-104 &lt;= nums[i] &lt;= 104</code></li>
	<li><code>nums</code> contains distinct values sorted in ascending order.</li>
	<li><code>-104 &lt;= target &lt;= 104</code></li>
</ul>