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 vote172 views2 answers
Cplusplusbtutotrail
C++
3 votes202 views3 answers
Quick sort c++
C++
0 vote178 views1 answer
Cpp set time
C++
1 vote182 views1 answer
How to easily trim a str in c++
C++
-1 vote224 views2 answers
For c++
C++
0 vote164 views1 answer
Unknown amount of threads cpp
C++
0 vote229 views1 answer
Print value of data in c++
C++
1 vote198 views1 answer
Get window position
C++
2 votes207 views1 answer
C++ time nanoseconds
C++
0 vote180 views1 answer
C++ fonksion pointer
C++