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
翻译
实现“下一个排列”函数,将排列中的数字重新排列成字典序中的下一个更大的排列。
如果这样的重新排列是不可能的,它必须重新排列为可能的最低顺序(即升序排序)。
重排必须在原地,不分配额外的内存。
以下是一些示例,左侧是输入,右侧是输出:
1,2,3 → 1,3,2
3,2,1 → 1,2,3
1,1,5 → 1,5,1
所以题目的意思是,从上面的某一行重排到下一行,如果已经是最后一行了,则重排成第一行。
/* Function to reverse nums[] from start to end*/
public void rvereseArray(int nums[], int start, int end) {
while (start < end) {
int temp = nums[start];
nums[start++] = nums[end];
nums[end--] = temp;
}
}
public void nextPermutation(int[] nums) {
if (nums.length <= 1) return;
int len = nums.length - 1, i, j;
for (i = len - 1; i >= 0; i--) if (nums[i] < nums[i + 1]) break; //存在子升序的序列
if (i == -1) {//原数组完全是降序排列,已经是全排列最大一个,所以要返回全排列最小个.
rvereseArray(nums, 0, len);//反转数组
// Arrays.sort(nums);
return;
}
// find the right most item that's greater than nums[i]
for (j = len; j > i; j--) if (nums[i] < nums[j]) break;
int tmp = nums[i];
nums[i] = nums[j];
nums[j] = tmp;
// Arrays.sort(nums,i+1,len+1);
rvereseArray(nums, i + 1, len);//反转子升序列.
}
Runtime:
2 ms beats 11.25% of javasubmissions