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

1 vote349 views1 answer
Can you verify adsense no ssl certificate
C++
3 votes291 views1 answer
C++ how to make a negative float positive
C++
7 votes292 views1 answer
Migration meaning
C++
4 votes277 views1 answer
Git branch in my bash prompt
C++
0 vote288 views1 answer
Fisher–Yates shuffle Algorithm c++
C++
6 votes332 views2 answers
Find permutations
C++
3 votes285 views2 answers
All of the stars lyrics
C++
0 vote313 views1 answer
Qrandomgenerator bounded
C++
0 vote299 views1 answer
271533778232847
C++
1 vote288 views1 answer
Qt messagebox
C++