[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) {
	if (nums.size() <= 1) return;
	int n = nums.size();
	int i = n - 2;
	while (i >= 0 && nums[i] >= nums[i + 1]){//以最后一个字符为结束的最长递减序列
		--i;
	}
	if (i < 0){//非递增序列，最大Permutation，逆序为最小Permutation
		reverse(nums.begin(), nums.end());
		return;
	}
	//在nums[i+1]到nums[n-1]中大于nums[i]的最小值
	int j = n - 1;
	while(j > i && nums[j] <= nums[i]){
		--j;
	}
	swap(nums[j], nums[i]);
	sort(nums.begin() + i+1, nums.end());//将逆序序列正序
}
};