Package g0001_0100.s0041_first_missing_positive

Class Solution

java.lang.Object

g0001_0100.s0041_first_missing_positive.Solution

public class Solution
extends Object

41 - First Missing Positive.<p>Hard</p> <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><strong>Example 1:</strong></p> <p><strong>Input:</strong> nums = [1,2,0]</p> <p><strong>Output:</strong> 3</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> nums = [3,4,-1,1]</p> <p><strong>Output:</strong> 2</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> nums = [7,8,9,11,12]</p> <p><strong>Output:</strong> 1</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= nums.length <= 5 * 10⁵</code></li> <li><code>-2³¹ <= nums[i] <= 2³¹ - 1</code></li> </ul>

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	firstMissingPositive(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

firstMissingPositive

public int firstMissingPositive(int[] nums)