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 vote76 views1 answer
Abstraction in cpp
C++
0 vote82 views1 answer
Pragma cpp
C++
14 votes69 views4 answers
C++ create vector of size
C++
1 vote83 views3 answers
Arduino get size of array
C++
0 vote92 views1 answer
Visual studio code include path not working c++
C++
0 vote113 views1 answer
C++ with SVD
C++
0 vote67 views1 answer
Recursive power in c++
C++
2 votes69 views2 answers
C++ back()
C++
0 vote97 views1 answer
Prisma client
C++
1 vote63 views1 answer
What is __asm in C++
C++