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 vote266 views1 answer
Makefile for single cpp file
C++
0 vote266 views1 answer
What do I return in int main() function c++
C++
-1 vote216 views1 answer
Dynamic 2d array c++
C++
19 votes314 views4 answers
How to get size of 2d vector in c++
C++
1 vote256 views1 answer
C++ shortcuts in desktopp app
C++
1 vote304 views1 answer
Error C4840: non-portable use of class 'FString' as an argument to a variadic function
C++
0 vote281 views1 answer
How to save system function output into a variable in c++
C++
0 vote277 views1 answer
Sfml get position
C++
2 votes265 views2 answers
Selection sort c++ algorithm
C++
1 vote278 views1 answer
How to round to nearest whole number unity
C++