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

1 vote356 views2 answers
How to print numbers with only 2 digits after decimal point in c++
C++
0 vote338 views1 answer
Udo apt install dotnet-sdk-5 permission denied
C++
1 vote346 views1 answer
Make cin cout faster
C++
10 votes344 views3 answers
How to find maximum value in c++
C++
0 vote395 views1 answer
How to use printf with <cinttypes> c++
C++
0 vote339 views1 answer
Closing a ifstream file c++
C++
1 vote336 views1 answer
Ue4 spawn actor c++
C++
0 vote328 views1 answer
Thread group c++
C++
9 votes337 views4 answers
Print vector c++
C++
2 votes376 views1 answer
Rng c++
C++