Leetcode 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

本题相当于全排的一种变种。根据当前的排序来找下一个排序结果。先上代码

class Solution {
public:
    void nextPermutation(vector<int>& nums) {
        int pos = -1;
        int len = nums.size();
        for(int i = len-1; i>0; i--){
            if(nums[i] > nums[i-1]){
                pos = i-1;
                break;
            }
        }

        if(pos < 0){
            reverse(nums, 0, len-1);
            return;
        }

        for(int i = len - 1; i > pos; i--){
            if(nums[i] > nums[pos]){
                int tmp = nums[pos];
                nums[pos] = nums[i];
                nums[i] = tmp;
                break;
            }
        }

        reverse(nums, pos+1, len-1);
    }

    void reverse(vector<int>& num, int begin, int end){
        int l = begin;
        int r = end;
        while(l<r){
            int tmp;
            tmp = num[l];
            num[l] = num[r];
            num[r] = tmp;
            l++;
            r--;
        }
    }
};

步骤大致分为三步：
1）找到最后一个升序的位置
2）若不存在则直接反排，否则3）
3）找到Pos之后最后一个比它大的位置，然后交换，对pos之后的元素反排。