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

31. Next Permutation leetcode solution in c++

coder answered on April 4, 2022 Popularity 7/10 Helpfulness 3/10

answer 31. Next Permutation leetcode solution in c++

31. Next Permutation leetcode solution in c++

Comment

class Solution {
public:
    void nextPermutation(vector<int>& nums) {
        int n=nums.size()-1;
        bool flag=false;
        for(int i=0;i<n;i++)
        {
            if(nums[i]<nums[i+1])
            {
                flag=true;
                break;
            }
        }
        //check
        if(flag)
        {
            int k;
            for(int i=n-1;i>=0;i--)
            {
                if(nums[i]<nums[i+1])
                {
                    k=i;
                    break;
                }
            }
            int j;
            for(int i=n;i>k;i--)
            {
                if(nums[i]>nums[k])
                {
                    j=i;
                    break;
                }
            }
            swap(nums[k],nums[j]);
            reverse(nums.begin()+k+1,nums.end());
        }else
        {
            reverse(nums.begin(),nums.end());
        }
    }
};

Popularity 7/10 Helpfulness 3/10 Language cpp

Source: www.codegrepper.com

Tags: c++ next permutation solution

Link to this answer
Share Copy Link