LeetCode-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.

Solution:

Code:

<span style="font-size:14px;">class Solution {
public:
    int firstMissingPositive(int A[], int n) {
        for (int i = 0; i < n;)
            if (A[i] != i+1 && A[i]-1 >= 0 && A[i]-1 < n && A[A[i]-1] != A[i])
                swap(A[i], A[A[i]-1]);
            else ++i;
        for (int i = 0; i < n; ++i)
            if (A[i] != i+1) return i+1;
        return n+1;
    }
};</span>