Given an unsorted integer array, find the smallest missing positive integer.
Input: [1,2,0]
Output: 3
Input: [3,4,-1,1]
Output: 2
Input: [7,8,9,11,12]
Output: 1
Your algorithm should run in O(n) time and uses constant extra space O(1).
FirstMissingPositive
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
parent directory.. | ||||