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

Subscribe to see which companies asked this question.

给出一个序列，找出其下一个排列。求下一个排列就是找出后面倒序的部分和该部分的前一个数m，然后找出倒序部分中比m大的第一个数n。交换m和n，然后倒转倒序部分。以1,3,4,2为例，现在固定部分是1,3，倒序部分是4,2，倒序说明这部分的数的排列已经完成。则以后若干个排列的固定部分就是1,4，后面部分由2,3组成。故1,3,4,2的下一排列为1,4,2,3。

代码：

class Solution
{
public:
	void nextPermutation(vector<int>& nums)
	{
		auto it = is_sorted_until(nums.rbegin(), nums.rend());
		if(it != nums.rend())
		{
			swap(*it, *upper_bound(nums.rbegin(), it, *it));
		}
		reverse(nums.rbegin(), it);
	}
};