next_permutation

题目网址

实现函数next permutation（下一个排列）：将排列中的数字重新排列成字典序中的下一个更大的排列。将排列中的数字重新排列成字典序中的下一个更大的排列。
如果不存在这样的排列，则将其排列为字典序最小的排列（升序排列）
需要使用原地算法来解决这个问题，不能申请额外的内存空间
下面有机组样例，左边是输入的数据，右边是输出的答案
1,2,3→1,3,2
3,2,1→1,2,3
1,1,5→1,5,1

Implement next permutation, which rearranges numbers into the lex
icographically 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

solution

直接用API. next_permutation传送门

class Solution {
public:
    void nextPermutation(vector<int> &num) {
        next_permutation(num.begin(), num.end());
    }
};

class Solution {
public:
    void nextPermutation(vector<int> &num) {
        if(num.size()<=1) return;
        int i = num.size()-1;
        while(i>0 && num[i]<=num[i-1]) --i;
        if(i==0) {                           //5,4,3,2,1
            reverse(num.begin(),num.end());
        }else{
            int j = num.size()-1;
            while(num[j]<=num[i-1]) --j;
            swap(num[j],num[i-1]);
            reverse(num.begin()+i,num.end());
        }
    }
};