g0001_0100.s0031_next_permutation

Class Solution

java.lang.Object

g0001_0100.s0031_next_permutation.Solution

public class Solution
extends Object

31 - Next Permutation.

Medium

Implement next permutation , which rearranges numbers into the lexicographically next greater permutation of numbers.

If such an arrangement is not possible, it must rearrange it as the lowest possible order (i.e., sorted in ascending order).

The replacement must be in place and use only constant extra memory.

Example 1:

Input: nums = [1,2,3]

Output: [1,3,2]

Example 2:

Input: nums = [3,2,1]

Output: [1,2,3]

Example 3:

Input: nums = [1,1,5]

Output: [1,5,1]

Example 4:

Input: nums = [1]

Output: [1]

Constraints:

• 1 <= nums.length <= 100
• 0 <= nums[i] <= 100

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
void	nextPermutation(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

nextPermutation

public void nextPermutation(int[] nums)