Breaking News: Grepper is joining You.com. Read the official announcement!

first missing number leetcode

Lucky Llama answered on October 2, 2020 Popularity 8/10 Helpfulness 4/10

answer first missing number leetcode

first missing number leetcode

Comment

 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;
    }

Popularity 8/10 Helpfulness 4/10 Language cpp

Source: Grepper

Tags: c++

Link to this answer
Share Copy Link

Contributed on Oct 02 2020

Lucky Llama

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

first missing number leetcode

Contents

More Related Answers

first missing number leetcode

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.