First missing integer leetcode

First missing number leetcode

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

Source: grepper.com

Similar codes

0 vote367 views1 answer
How to create a c++ templeate
C++
2 votes373 views1 answer
How to use python sleep function on c++
C++
0 vote370 views1 answer
Sum of first 100 natural numbers
C++
3 votes339 views4 answers
C++ char array size
C++
2 votes343 views2 answers
Char
C++
0 vote334 views1 answer
How to get window size sfml
C++
1 vote332 views1 answer
Eosio name to string
C++
0 vote332 views1 answer
Sinh to hop c++
C++
4 votes362 views1 answer
Gcd of two numbers c++
C++
1 vote348 views1 answer
C++ milliseconds
C++