leetcode--缺失的第一个正数(原地hash)

class Solution {
public:
    int firstMissingPositive(vector<int>& nums) {
        int len = nums.size();

        for(int i = 0; i < len; i++){
            while(nums[i] > 0 && nums[i] <= len && nums[nums[i]-1] != nums[i]){
                swap(nums, nums[i]-1, i);
            } 
        }
        for(int i = 0; i < len; i++){
            if(nums[i] != i+1){
                return i+1;
            }
        }
        return len+1;

    }
    void swap(vector<int>& nums, int i, int j){
        int temp = nums[i];
        nums[i] = nums[j];
        nums[j] = temp;
    }
};