链接:http://leetcode.com/onlinejudge#question_41
原题:
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.
思路:如果题目没有空间O(1)的要求,那么另外开一个和数组相同长度的bool数组B,然后遍历数组
if 1 <= A[i] <= n, B[A[i]-1] = true,然后遍历B数组,第一个false值下标+1就是结果。
但是,现在有空间要求,所以要在原数组中做文章,仔细想一下,只要不停的交换要覆盖的值就行了。
PS:相互交换的值不能相等,否则会死循环的。
代码:
class Solution {
public:
int firstMissingPositive(int A[], int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
for (int i=0; i<n; ) {
if (A[i]>=1 && A[i]<=n && A[i]!=i+1) {
if (A[i] == A[A[i]-1]) {
i++;
continue;
}
int temp = A[A[i]-1];
A[A[i]-1] = A[i];
A[i] = temp;
} else
i++;
}
int j = 0;
for (j; j<n; j++)
if (A[j] != j+1)
break;
return j+1;
}
};