g0001_0100.s0041_first_missing_positive.readme.md Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java11 Show documentation
Show all versions of leetcode-in-java11 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
The newest version!
41\. First Missing Positive
Hard
Given an unsorted integer array `nums`, return the smallest missing positive integer.
You must implement an algorithm that runs in `O(n)` time and uses constant extra space.
**Example 1:**
**Input:** nums = [1,2,0]
**Output:** 3
**Example 2:**
**Input:** nums = [3,4,-1,1]
**Output:** 2
**Example 3:**
**Input:** nums = [7,8,9,11,12]
**Output:** 1
**Constraints:**
* 1 <= nums.length <= 5 * 105
* -231 <= nums[i] <= 231 - 1