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 vote276 views1 answer
Max pooling in c++
C++
6 votes272 views2 answers
Get data from terminal c++
C++
3 votes253 views1 answer
What language was c+ written in
C++
0 vote255 views1 answer
Cpp array init value
C++
0 vote286 views1 answer
C++ overloading by ref-qualifiers
C++
0 vote281 views1 answer
Rotate an array of n elements to the right by k steps
C++
0 vote262 views1 answer
String to hexadecimal in c
C++
481 votes355 views10 answers
December global holidays
C++
0 vote257 views1 answer
Getline vs cin.getline
C++
0 vote284 views1 answer
C++ uint32_t
C++