/**
knakul853
**/
class Solution {
public:
    void nextPermutation(vector<int>& nums) {

        int n = (int)nums.size();
        int i=0;
        for(i=n-2;i>=0; i--)
        {
            if(nums[i] < nums[i+1]){
                break;
            }
        }

        if(i < 0){
        reverse(nums.begin(), nums.end());
            return;
        }

        int l=0;
        for( int j=n-1;j>i; j-- )
        {
            if(nums[j] > nums[i]){
            swap(nums[j], nums[i]);
            break;
            }
        }

        reverse(nums.begin()+i+1, nums.end());

    }
};