First Missing Positive
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.
class Solution {
public:
int firstMissingPositive(int A[], int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if(n<1)
return 1;
int i=0;
int tmp = 0;
for(i=0;i<n;i++)
{
tmp=A[i];
if(A[i]>0&&A[i]<=n&&A[i]!=i+1&&A[i]!=A[tmp-1])
{
A[i]=A[tmp-1];
A[tmp-1]=tmp;
i--;
}
}
for(i=0;i<n;i++)
{
if(A[i]!=i+1)
break;
}
return i+1;
}
};