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.
1. 解法1
解题思路:
- 如果未限制使用空间,这道题用hash map最简单.
class Solution {
public:
int firstMissingPositive(vector<int>& nums) {
unordered_map<int, bool> unMap;
int n = nums.size();
int max = INT_MIN;
for(int i = 0; i < n; i++) {
unMap[nums[i]] = true;
if(nums[i] > max)
max = nums[i];
}
int i;
for(i = 1; i <= max; i++) {