Next-permutation/leetcode_solution.cpp at main · Sun-0321/Next-permutation · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

void nextPermutation(vector<int>& nums)
{
        int i=nums.size()-1;
        while(i)
        {
            if(nums[i]>nums[i-1])
            {
                for(int j=nums.size()-1;;j--)
                {
                    if(nums[j]>nums[i-1])
                    {
                        swap(nums[j],nums[i-1]);
                        reverse(nums.begin()+i,nums.end());
                        return;
                    }
                }
            }
            i--;
        }
        reverse(nums.begin(),nums.end());

 }