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 vote169 views1 answer
Map::begin
C++
0 vote223 views1 answer
Unordered_set to vector
C++
75 votes224 views6 answers
Conda list envs
C++
4 votes212 views1 answer
Deep copy c++
C++
4 votes206 views2 answers
Input pdf latex
C++
0 vote168 views1 answer
41.00
C++
0 vote162 views2 answers
Interface in c++
C++
4 votes172 views2 answers
C++ cin operator
C++
1 vote206 views1 answer
C++ data structures
C++
0 vote134 views1 answer
Replace a substring with another string in c++
C++