{leetcode}/problems/first-missing-positive/[LeetCode - First Missing Positive^]
这道题跟 {leetcode}/problems/missing-number/[268. Missing Number - LeetCode^] 很像！
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.
- 一刷
-
link:{sourcedir}/_0041_FirstMissingPositive.java[role=include] - 二刷
-
link:{sourcedir}/_0041_FirstMissingPositive_2.java[role=include]
-
41. 缺失的第一个正数 - 原地哈希（哈希函数为：f(nums[i) = nums[i] - 1）^]