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

对一个序列nums来说，首先从后往前遍历，找到第一个满足nums[i]< nums[i+1]的项，记录pos = i。
那么此时nums[pos+1],…,nums[len-1]为降序序列。
我们要将nums[pos]与降序序列nums[pos+1],…,nums[len-1]中最后一个大于它的项交换。
然后将交换后的序列nums[pos+1],…,nums[len-1]取反向即可。

例如：原始序列1 2 1 5 4 3 2 2 1
得到pos = 2。nums[2] = 1
将nums[2]与序列nums[3], … , nums[len - 1]中最后一个大于它的项交换，即与nums[7]交换，得1 2 2 5 4 3 2 1 1
将nums[3], … , nums[len - 1]取反向，得1 2 2 1 1 2 3 4 5

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

        if(pos == -1) reverse(nums.begin(), nums.end());
        else{
            for(int i = nums.size() - 1; i > pos; --i)
                if(nums[i] > nums[pos]){
                    int tmp = nums[i];
                    nums[i] = nums[pos];
                    nums[pos] = tmp;
                    break;
                }
            reverse(nums.begin() + pos + 1, nums.end());
        }
    }
};