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 vote101 views2 answers
344. Reverse String c++
C++
-1 vote101 views1 answer
Assigning a seed on a random number generator in C++
C++
0 vote116 views1 answer
Insert only unique values into vector
C++
0 vote107 views3 answers
Options select from array
C++
0 vote106 views1 answer
C++ write to file in directory
C++
2 votes97 views2 answers
Stack algorithm in c++
C++
-1 vote107 views1 answer
Can derived class access private members
C++
-1 vote108 views2 answers
Inline function in cpp
C++
1 vote95 views3 answers
How to use cout function in c++
C++
2 votes113 views1 answer
C++ primality test
C++