leetcode_30 Next Permutation

最新推荐文章于 2021-04-09 23:29:56 发布

ivebeenready

最新推荐文章于 2021-04-09 23:29:56 发布

阅读量435

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/ivebeenready/article/details/49048899

版权

LeetCode 专栏收录该内容

21 篇文章 0 订阅

订阅专栏

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

这一题是求出当前给出序列的下一个字典序。比如比123正好大一点的数是132。

思路就是先先从后往前找出一对数，这对数前面的数字（a）小于后面的数字（b）；然后从后往前找出第一个比a大的数(c)，交换两者位置，对a后面的数进行翻转即可。

#include<iostream>
#include<vector>
using namespace std;

void nextPermutation(vector<int>& nums)
{
	int len = nums.size();
	if (len <= 1) 
		return;
	int i = len - 2;
	int j = len - 1;

	while (i >= 0 && nums[i] >= nums[j])
	{
		--i;
		--j;
	}
	if (i < 0)
	{
		reverse(nums.begin(), nums.end());
		return;
	}
	int k = nums.size();
	while (nums[i] >= nums[--k]);
	swap(nums[i], nums[k]);
	reverse(nums.begin() + j, nums.end());
}