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 vote230 views1 answer
Lexene token pairs of java codes
C++
0 vote273 views1 answer
How to pass std::array with unknown size to function C++
C++
2 votes246 views4 answers
For loop with array c++
C++
0 vote230 views1 answer
Get elements of 2d array c++
C++
0 vote229 views1 answer
How to put string in array c++
C++
0 vote234 views1 answer
C++ cout format specifier for correct number of decimal points
C++
0 vote243 views1 answer
Langestpalindromicsubsequence(dp)
C++
37 votes228 views3 answers
C++ hello word
C++
0 vote255 views1 answer
Youtube backlink generator tool
C++
1 vote232 views1 answer
How to make sure the user inputs a int and not anything else c++
C++