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).
java
public class Solution {
/*
* @param nums: An array of integers
* @return: nothing
*/
public void nextPermutation(int[] nums) {
// write your code here
if (nums == null || nums.length == 0 || nums.length == 1) {
return;
}
int pointer = nums.length - 2;
while (pointer >= 0 && nums[pointer] >= nums[pointer + 1]) {
pointer--;
}
if (pointer < 0) {
Arrays.sort(nums);
return;
}
int node = pointer + 1;
while (node < nums.length && nums[node] > nums[pointer]) {
node++;
}
int temp = nums[node - 1];
nums[node - 1] = nums[pointer];
nums[pointer] = temp;
Arrays.sort(nums, pointer + 1, nums.length);
}
}
python
class Solution:
"""
@param: nums: An array of integers
@return: nothing
"""
def nextPermutation(self, nums):
# write your code here
if nums is None or len(nums) == 0 or len(nums) == 1:
return
pointer = len(nums) - 2
while pointer >= 0 and nums[pointer] >= nums[pointer + 1]:
pointer -= 1
if pointer < 0:
nums.sort()
return
node = pointer + 1
while node < len(nums) and nums[node] > nums[pointer]:
node += 1
nums[pointer], nums[node - 1] = nums[node - 1], nums[pointer]
arr = nums[pointer + 1:]
arr.sort()
path = nums[:pointer + 1] + arr
for i in range(len(path)):
nums[i] = path[i]