first-missing-positive

题目描述

 

Given an unsorted integer array, find the first missing positive integer.

For example,
Given[1,2,0]return3,
and[3,4,-1,1]return2.

Your algorithm should run in O(n) time and uses constant space.

---

/*
思路：
对于每一个数i都调整到i-1位置,调整后需要接着判断该位置；
接着重头遍历数组，找到第一个a[i]!=i+1的位置就返回i+1
*/

class Solution {
public:
    int firstMissingPositive(int A[], int n) {
        for(int i = 0; i < n; i++){
            if(A[i] >= 1 && A[i] <= n && A[i] != A[A[i] - 1]){
                swap(A[i], A[A[i] - 1]);
                i--;
            }
        }
        for(int i = 0; i < n; i++){
            if(A[i] != i+1)
                return i+1;
        }
        return n+1;
    }
};