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
题目大意:
实现next permutation(下一个排列),重新排列数组中的数,使得到的新数组的字典序恰好大于原数组。
如果不存在这样的排列,就将原数组从小到大排序。
替换必须就地进行,不要分配额外的内存。
解题思路:
首先从右向左遍历数组,找到第一个相邻的左<右的数对,记右下标为x,则左下标为x - 1
若x > 0,则再次从右向左遍历数组,直到找到第一个大于nums[x - 1]的数字为止,记其下标为y,交换nums[x - 1], nums[y]
最后将nums[x]及其右边的元素就地逆置