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

15 votes289 views4 answers
How to make a random number in c++
C++
0 vote319 views1 answer
Amusia
C++
3 votes307 views1 answer
C++ initialize array with all zeros
C++
2 votes319 views2 answers
Sieve of eratosthenes c++
C++
0 vote295 views1 answer
Tutti i tipi di equazioni trigonometriche
C++
20 votes286 views2 answers
C++ rewrite file
C++
2 votes319 views1 answer
Ue4 cpp OnHit
C++
0 vote323 views1 answer
Cocos2d c++ linux
C++
1 vote323 views1 answer
How to delete an element in vector pair in cpp
C++
0 vote314 views1 answer
Lambda function qt connect
C++