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 vote145 views1 answer
Factorial using recursion cpp
C++
27 votes162 views6 answers
Bootstrap grid
C++
0 vote170 views1 answer
C++ class constructor variable arguments
C++
0 vote153 views1 answer
Xor in c++
C++
1 vote179 views1 answer
Lpcwstr to string c++
C++
0 vote163 views1 answer
Error: Microsoft Visual C++ 14.0 or greater is required. Get it with "Microsoft C++ Build Tools":
C++
0 vote189 views1 answer
How to analyse a poem
C++
15 votes149 views2 answers
Calculate factorial
C++
0 vote147 views1 answer
Convert c program to c ++ online
C++
0 vote152 views1 answer
Sideways triangle c++ xy plane
C++