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

-1 vote206 views1 answer
How to rename a file in cpp
C++
4 votes193 views3 answers
Count set bits in an integer c++
C++
1 vote210 views1 answer
Shout sharkest
C++
0 vote184 views1 answer
How can I delete a substring from a string in c++?
C++
0 vote203 views1 answer
Compile in c++
C++
5 votes203 views4 answers
Split pdf
C++
3 votes202 views3 answers
Find all occurrences of a substring in a string c++
C++
0 vote209 views1 answer
Changing key bindings in visual code not working
C++
1 vote280 views1 answer
Qt qstring to double
C++
0 vote186 views1 answer
Character convert c++
C++