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

3 votes206 views2 answers
Lambda function in c++
C++
0 vote216 views1 answer
Reverse Square Root
C++
19 votes219 views1 answer
C++ files
C++
0 vote213 views1 answer
C++ typeid get type name
C++
1 vote211 views1 answer
Find largest number in vector c++
C++
0 vote202 views1 answer
Unknown amount of threads cpp
C++
2 votes204 views1 answer
Variable vs pointer in c++
C++
0 vote202 views1 answer
Sfml disable message
C++
1 vote202 views1 answer
Print std map
C++
0 vote209 views2 answers
#define in cpp
C++