mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 19:53:12 +08:00
23 lines
781 B
HTML
23 lines
781 B
HTML
<p>Given an unsorted integer array <code>nums</code>, return the smallest missing positive integer.</p>
|
|
|
|
<p>You must implement an algorithm that runs in <code>O(n)</code> time and uses constant extra space.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<pre><strong>Input:</strong> nums = [1,2,0]
|
|
<strong>Output:</strong> 3
|
|
</pre><p><strong>Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> nums = [3,4,-1,1]
|
|
<strong>Output:</strong> 2
|
|
</pre><p><strong>Example 3:</strong></p>
|
|
<pre><strong>Input:</strong> nums = [7,8,9,11,12]
|
|
<strong>Output:</strong> 1
|
|
</pre>
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 5 * 10<sup>5</sup></code></li>
|
|
<li><code>-2<sup>31</sup> <= nums[i] <= 2<sup>31</sup> - 1</code></li>
|
|
</ul>
|