Next Permutation

Next Permutation

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.

If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order).

The replacement must be in-place, do not allocate extra memory.

Here are some examples. Inputs are in the left-hand column and its corresponding outputs are in the right-hand column.
1,2,3 → 1,3,2
3,2,1 → 1,2,3
1,1,5 → 1,5,1

题目大意：求出给定数组的下一个排列。可以调用STL库函数next_permutation来实现，特别要注意的是，当前排列是全排列的最后一个排列的时候，返回的是全排列的第一个排列。

 

Code:

void nextPermutation(vector<int> &num) {
        if(next_permutation(num.begin(),num.end()))
             return ;
        sort(num.begin(),num.end());
    }