DSA problem
Next Permutation
A permutation of an array of integers is an arrangement of its members into a sequence or linear order.
The next permutation of an array of integers is the next lexicographically greater permutation of its integers. More formally, if all the permutations of the array are sorted in one container according to their lexicographical order, then the next permutation of that array is the permutation that follows it. If such an arrangement is not possible, the array must be rearranged to the lowest possible order (sorted in ascending order).
Given an array of integers nums, find the next permutation of nums. The replacement must be done in-place and use only constant extra memory.
The algorithm works by finding the rightmost ascending pair, swapping the pivot with the smallest larger value to its right, and then reversing the tail to make it as small as possible.
Examples
nums = [1,2,3][1,3,2]nums = [3,2,1][1,2,3]nums = [1,1,5][1,5,1]Constraints
- 1 <= nums.length <= 100
- 0 <= nums[i] <= 100
3 hints and a full solution walkthrough with step-by-step visualizations are available in the practice editor.