Implement the next permutation
, which rearranges numbers into the numerically next greater permutation of numbers for a given array A
of size N
If such an arrangement is not possible, it must be rearranged in the lowest possible order i.e., sorted in ascending order. Note:
- The replacement must be in-place, do not allocate extra memory.
- DO NOT USE LIBRARY FUNCTION FOR NEXT PERMUTATION. Use of Library functions will disqualify your submission retroactively and will give you penalty points.
1 <= N <= 5e5Input Format
1 <= A[i] <= 1e9
The first and the only argument of input has an array of integers, A.Output Format
Return an array of integers, representing the next permutation of the given array.Example Input
A = [1, 2, 3]
A = [3, 2, 1]
A = [1, 1, 5]
A = [20, 50, 113]
[1, 3, 2]
[1, 2, 3]
[1, 5, 1]
[20, 113, 50]
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified.
Still have a question? Checkout Sample Codes for more details.