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

4 votes127 views1 answer
C++ natural log
C++
0 vote128 views1 answer
Char vector to string c++
C++
0 vote145 views1 answer
Zsh: segmentation fault ./provided_files.exe erosion X \.
C++
0 vote154 views1 answer
Cout alternative c++
C++
0 vote214 views1 answer
C++ add to array
C++
0 vote143 views1 answer
This is my p phone number in punjabi
C++
0 vote138 views1 answer
How to fixed how many digit will be after point in c++
C++
0 vote156 views1 answer
Void does not a name a type in cpp
C++
1 vote138 views1 answer
How to add colored text in c++
C++
1 vote156 views3 answers
Right shift in c++
C++