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 and use only constant 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 void NextPermutation(int[] nums) {
if (nums == null || nums.Length <= 1) return;
else {
int i = 0;
while (i < nums.Length - 1 && nums[i] >= nums[i + 1]) {
i++;
}
if (i == nums.Length - 1) {
Array.Sort(nums);
}
else {
List<int> a = new List<int>();
int j = nums.Length - 1;
int max = nums[j--];
a.Add(max);
while (j >= 0) {
if (max > nums[j]) {
int temp = max;
foreach(int t in a) {
if (t > nums[j] && t < temp) {
temp = t;
}
}
a.Remove(temp);
max = temp;
a.Add(nums[j]);
nums[j] = max;
int[] b = a.ToArray();
Array.Sort(b);
for (int k = j + 1, m = 0; k < nums.Length; ++k, ++m) {
nums[k] = b[m];
}
break;
}
else {
a.Add(nums[j]);
max = nums[j];
}
--j;
}
}
}
}
}
Runtime: 228 ms, faster than 97.45% of C# online submissions for Next Permutation.
public class Solution {
public void nextPermutation(int[] nums) {
int i = nums.length - 2;
while (i >= 0 && nums[i + 1] <= nums[i]) {
i--;
}
if (i >= 0) {
int j = nums.length - 1;
while (j >= 0 && nums[j] <= nums[i]) {
j--;
}
swap(nums, i, j);
}
reverse(nums, i + 1);
}
private void reverse(int[] nums, int start) {
int i = start, j = nums.length - 1;
while (i < j) {
swap(nums, i, j);
i++;
j--;
}
}
private void swap(int[] nums, int i, int j) {
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
}
public class Solution {
public void NextPermutation(int[] nums) {
var i = nums.Length - 2;
while (i >= 0 && nums[i] >= nums[i + 1])
{
i--;
}
if (i >= 0)
{
var j = 0;
for (j = nums.Length - 1; j > i; j--)
{
if (nums[j] > nums[i]) break;
}
var temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
var l = i + 1;
var r = nums.Length - 1;
while (l < r)
{
var temp = nums[l];
nums[l] = nums[r];
nums[r] = temp;
l++;
r--;
}
}
}