<h2>35. Search Insert Position</h2><h3>Easy</h3><hr><div><p>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>

<p>You must&nbsp;write an algorithm with&nbsp;<code>O(log n)</code> runtime complexity.</p>

<p>&nbsp;</p>

<p><strong>Example 1:</strong></p>

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

<strong>Output:</strong> 2

</pre><p><strong>Example 2:</strong></p>

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

<strong>Output:</strong> 1

</pre><p><strong>Example 3:</strong></p>

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

<strong>Output:</strong> 4

</pre><p><strong>Example 4:</strong></p>

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

<strong>Output:</strong> 0

</pre><p><strong>Example 5:</strong></p>

<pre><strong>Input:</strong> nums = [1], target = 0

<strong>Output:</strong> 0

</pre>

<p>&nbsp;</p>

<p><strong>Constraints:</strong></p>

<ul>

<li><code>1 &lt;= nums.length &lt;= 10⁴</code></li>

<li><code>-10⁴ &lt;= nums[i] &lt;= 10⁴</code></li>

<li><code>nums</code> contains <strong>distinct</strong> values sorted in <strong>ascending</strong> order.</li>

<li><code>-10⁴ &lt;= target &lt;= 10⁴</code></li>

</ul>

</div>