19、下一个排列
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,2
3,2,1→1,2,3
1,1,5→1,5,1
题目要求:实现获取下一个排列的函数,算法需要将给定数字序列重新排列成字典序中下一个更大的排列。
如果不存在下一个更大的排列,则将数字重新排列成最小的排列(即升序排列)
必须原地修改,只允许使用额外常数空间。
代码如下:
public class Solution{
public static void main(String[] args)
{
Solution sl = new Solution();
int[] nums= {1,4,3,2};
int len=nums.length;
sl.nextPermutation(nums);
for(int i=0;i<len;i++)
{
System.out.print(nums[i]);
}
}
public void nextPermutation(int[] nums) {
int n = nums.length;
int i = n - 1;
for(; i >= 1; i--) {
if(nums[i] > nums[i - 1]) {
break;
}
}
if(i >= 1) {
int j = n - 1;
for(; j >= i; j--) {
if(nums[j] > nums[i - 1]) {
break;
}
}
swap(i - 1, j, nums);
reverse(nums, i);
}else {
reverse(nums, 0);
}
}
private void reverse(int[] nums, int index) {
int i = index;
int j = nums.length - 1;
while(i < j) {
swap(i, j, nums);
i++;
j--;
}
}
private void swap(int i, int j, int[] nums) {
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
}