Next Permutation

mplement 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.

这道题如果明白啥叫lexicographically就算会做了。。。坑爹的题目。。。STL居然有这么个algorithm叫find_nextPermutation....

1. 从后往前扫，找到第一个左面小于右面的，i

2. 从后扫到 i-1, 包括 i, 找第一个大于i的j， 否则找不到的话也要进行第三步

3. 交换 i,j数

4. 因为 descending是最大，那么ascending就是最小， 那么reverse一下

5. 如果一直没找到，直接reverse.

class Solution {
public:
    void nextPermutation(vector<int> &num) {
        int len=num.size(); 
        for (int i=len-2; i>=0;i--){
            // find the last ascending pair
            if (num[i+1]>num[i]){
                int j;
                for (j=len-1;j>i-1;j--)
                    if (num[j]>num[i])
                        break;
                // include j=i;
                swap(num[i],num[j]);
                reverse(num.begin()+i+1,num.end());
                return;
            }
        }
        reverse(num.begin(),num.end());
    }
};