Discover Packages
github.com/openset/leetcode
problems
first-missing-positive
package
Version:
v1.6.3
Opens a new window with list of versions in this module.
Published: May 30, 2020
License: MIT
Opens a new window with license information.
Imports: 0
Opens a new window with list of imports.
Imported by: 0
Opens a new window with list of known importers.
README
README
¶
< Previous
Next >
Given an unsorted integer array, find the smallest missing positive integer.
Example 1:
Input: [1,2,0]
Output: 3
Example 2:
Input: [3,4,-1,1]
Output: 2
Example 3:
Input: [7,8,9,11,12]
Output: 1
Note:
Your algorithm should run in O (n ) time and uses constant extra space.
[Array ]
Similar Questions
Missing Number (Easy)
Find the Duplicate Number (Medium)
Find All Numbers Disappeared in an Array (Easy)
Couples Holding Hands (Hard)
Hints
Hint 1
Think about how you would solve the problem in non-constant space. Can you apply that logic to the existing space?
Hint 2
We don't care about duplicates or non-positive integers
Hint 3
Remember that O(2n) = O(n)
Expand ▾
Collapse ▴
Documentation
¶
There is no documentation for this package.
Source Files
¶
Click to show internal directories.
Click to hide internal directories.