题目:Given an unsorted integer array, find the first missing positive integer.
For example, Given [1,2,0] return 3, and [3,4,-1,1] return 2.
Your algorithm should run in O(n) time and uses constant space.
解析:该题目本质上是桶排序 (bucket sort),时间复杂度为 O(n),代码如下:
// 时间复杂度 O(n),空间复杂度 O(1)
class Solution {
public:
int firstMissingPositive(vector<int>& nums) {
bucket_sort(nums);
for (int i = 0; i < nums.size(); ++i)
if (nums[i] != i + 1)
return i + 1;
return nums.size() + 1;
}
private:
void bucket_sort(vector<int>& nums) {
const int n = nums.size();
for (int i = 0; i < n; ++i) {
while (A[i] != i + 1) {
if (A[i] <= 0 || A[i] > n || A[i] == A[A[i] - 1])
break;
swap(A[i], A[A[i] - 1]);
}
}
}
};