class Solution {
public:
int firstMissingPositive(int A[], int n) {
for(int i =0 ;i < n;i++)
{
if(A[i]<=n && A[i] > 0)
{
int temp = A[i];
if(A[i] != A[temp-1])
{
A[i] = A[temp-1];
A[temp-1] = temp;
i--;
}
}
}
int result = 1;
for(int i =0 ; i < n;i++)
{
if(A[i] != result)
return result;
result++;
}
return result;
}
};
leetcode:First Missing Positive
最新推荐文章于 2019-01-13 06:58:39 发布