首页 > 代码库 > [leetcode]Next Permutation @ Python
[leetcode]Next Permutation @ Python
原题地址：https://oj.leetcode.com/problems/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,23,2,1 → 1,2,31,1,5 → 1,5,1
解题思路：
输出字典序中的下一个排列。比如123生成的全排列是：123，132，213，231，312，321。那么321的next permutation是123。下面这种算法据说是STL中的经典算法。在当前序列中，从尾端往前寻找两个相邻升序元素，升序元素对中的前一个标记为partition。然后再从尾端寻找另一个大于partition的元素，并与partition指向的元素交换，然后将partition后的元素（不包括partition指向的元素）逆序排列。比如14532，那么升序对为45，partition指向4，由于partition之后除了5没有比4大的数，所以45交换为54，即15432，然后将partition之后的元素逆序排列，即432排列为234，则最后输出的next permutation为15234。确实很巧妙。
代码:
class Solution: # @param num, a list of integer # @return a list of integer def nextPermutation(self, num): if len(num) < 2: return num partition = -1 for i in range(len(num) - 2, -1, -1): if num[i] < num[i + 1]: partition = i break if partition == -1: return num[::-1] for i in range(len(num) - 1, partition, -1): if num[i] > num[partition]: num[i], num[partition] = num[partition], num[i] break num[partition + 1:] = num[partition + 1:][::-1] return num
参考致谢:
上述代码基于[1]进行优化
[1] http://www.cnblogs.com/zuoyuan/p/3780167.html
[leetcode]Next Permutation @ Python