[leetcode]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

next_permutation
首先，从最尾端开始往前寻找两个相邻元素，令第一元素为*i，第二元素为*ii，且满足*i < *ii。

找到这样一组相邻元素后，再从尾端开始往前查找，找出第一个大于*i的元素，令为*j，将i,j元素对调，

再将ii及之后的所有元素颠倒排列。此时即为所求之“后一个”排列组合。

    void nextPermutation(vector<int> &num) {
        int i, ii, j;
        
        int len = num.size();
        if(len == 1) return;
        if(len == 2) {
            swap(num[0], num[1]);
            return;
        }
        ii = i = 0;
        for(int k = len - 1; k > 0; k--){
            if(num[k] > num[k - 1]){
                ii = k;
                i = k - 1;
                break;
            }
        }
        if(i == ii){
            int b = 0, e = len - 1;
            while(b < e){
                swap(num[b], num[e]);
                b++; e--;
            }
            return;
        }
        for(int k = len - 1; k > 0; k--){
            if(num[k] > num[i]) {
                j = k;
                break;
            }
        }
        swap(num[i], num[j]);
        while(ii < len - 1){
            swap(num[ii], num[len - 1]);
            ii++; len--;
        }
    }