LeetCode-41. First Missing Positive
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.
解题思路:首先将数组的元素放在应该放的位置,例如对于Example 2:中的3应该放在第三位,然后判断容器的第k位是否为k,若不是则返回该值。注意容器为空或只有[1]的情况。
class Solution {
public:
int firstMissingPositive(vector<int>& nums) {
for (int i=0; i < nums.size(); ++i)
{
while (nums[i] > 0 && nums[i] < nums.size() && nums[nums[i] - 1] != nums[i])
{
swap(nums[nums[i] - 1], nums[i]);
}
}
for (int i = 0; i < nums.size(); ++i)
if (nums[i] != i + 1)
return i + 1;
return 1;
}
};