First Missing Positive（leetcode）

First Missing Positive（leetcode）

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(vector<int>& nums) {
        int i, tmp, t;
        for (i = 0; i < nums.size(); ++i) {
            while (nums[i] != i  && nums[i] >= 0 && nums[i] < nums.size()&& nums[nums[i]] != nums[i]) {
                tmp = nums[i];
                t = nums[i];
                nums[i] = nums[nums[i]];
                nums[t] = tmp;
            }
        }
        for (i = 1; i < nums.size(); ++i) {
            if (nums[i] != i)
                return i;
        }
        if (nums.size() == 0) 
            return 1;
        if (nums[0] == nums.size())
            return nums[0]+1;
        return nums.size();
    }
};

---