[leetcode]31. Next Permutation 下一个排列

Posted 2021-01-13 程序媛詹妮弗

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了[leetcode]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 and use only constant 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

以上是关于[leetcode]31. Next Permutation 下一个排列的主要内容，如果未能解决你的问题，请参考以下文章