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 vote160 views1 answer
Equalize problem codeforces
C++
0 vote164 views1 answer
String reverse iterator c++
C++
6 votes160 views2 answers
Stoi
C++
0 vote164 views1 answer
Memmove
C++
0 vote126 views1 answer
Electricity billing system project in c++
C++
0 vote158 views2 answers
Get min and max element index from vector c++
C++
0 vote167 views1 answer
Softwareegg.courses4u
C++
0 vote187 views1 answer
Stack implementation
C++
0 vote155 views2 answers
Faxc
C++
13 votes118 views4 answers
Type casting in c++
C++