← 返回 bytedance 的题目列表Find Smallest Missing Positive Integer in Array
类型：online_judge
bytedance
Given an unsorted integer array, find the smallest missing positive integer. The algorithm should run in O(n) time and use constant extra space.
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: You can assume no repeated integers in the array.
Example
Input
[1, 2, 0]