Hacktoberfest-21/31. Next Permutation.cpp at main · prashant-2906/Hacktoberfest-21 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
// leetcode question
class Solution {
public:

   void reverse(vector<int>& v,int l,int r)
{
    while(l<r)
    {
        swap(v[l++],v[r--]);
    }
}

void nextPer(vector<int>& nums) {
        int i,jg,lss=-1;
        for(i=nums.size()-1;i>0;--i)
        {
            if(nums[i-1]<nums[i])
            {
                lss=i-1;
                break;
            }
        }

        if(lss==-1)
        {
            reverse(nums,0,nums.size()-1);
            return;
        }


        for(jg=nums.size()-1;jg>0;--jg) /
        {
            if(nums[lss]<nums[jg])
            {
                break;
            }
        }


        swap(nums[lss],nums[jg]);

        ++lss;
        reverse(nums,lss,nums.size()-1);
    }

};