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 vote323 views1 answer
Destiny child
C++
0 vote295 views3 answers
JAJA
C++
1 vote339 views1 answer
C++ encapsulation
C++
5 votes316 views1 answer
Screen record ios simulator
C++
0 vote365 views1 answer
C++ average
C++
0 vote293 views1 answer
Matplotlib hide numbers on axis
C++
18 votes293 views2 answers
Stl for sorting IN C++
C++
1 vote307 views2 answers
C++ get type name
C++
0 vote354 views1 answer
Nearly similar rectangles hackerrank solution
C++
0 vote317 views1 answer
C++ set element at index
C++