题目描述:
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
题意:
求一个序列的下一个排列。
分析:
可以用 STL 里的 ‘next_permutation’ 偷懒。
具体算法是:
首先,从最尾端开始往前寻找两个相邻的元素,令第一个元素是 i,第二个元素是 ii,且满足
i<ii
;
然后,再从最尾端开始往前搜索,找出第一个大于 i 的元素,设其为 j;
然后,将 i 和 j 对调,再将 ii 及其后面的所有元素反转。python code如下:
class Solution: # @param num, a list of integer # @return nothing (void), do not return anything, modify num in-place instead. def nextPermutation(self, num): if not len(num): return idx = len(num) - 2 # 1. find out the last wrong order while idx >= 0 and num[idx] >= num[idx + 1]: idx -= 1 # 2. swap if idx >= 0: i = idx + 1 while i < len(num) and num[i] > num[idx]: i += 1 num[i - 1], num[idx] = num[idx], num[i - 1] # 3. reverse left, right = idx + 1, len(num) - 1 while left <= right: num[left], num[right] = num[right], num[left] left += 1 right -= 1