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:

class Solution {
public:
    int firstMissingPositive(vector<int>& nums) {
        int len = nums.size();
        for(int i = 0; i < len; ++i)
        {
            while(nums[i] != i + 1 && nums[i] > 0 && nums[i] <= len && nums[i] != nums[nums[i]-1])
            {
                swap(nums[nums[i]-1], nums[i]);
            }
        }
        int i = -1;
        while(++i < len)
        {
            if(nums[i] != i + 1) break;
        }

        return i + 1;
    }
};