Leetcode | Next Permutation, permutationleetcode
Problem
Next Permutation: https://leetcode.com/problems/next-permutation/
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, do not allocate 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
Analysis
First, you need to understand the meaning of the question:
Rearranges re-arranged; permutation arranged; ascending order in ascending order
Find the next arrangement of the current arrangement:
The next arrangement means that there is no other arrangement between this arrangement and the next one.
This requires that this arrangement and the next arrangement have the same prefix as long as possible, that is, the change is limited to the suffix as short as possible.
Code Implementation
// Rearranges is rearranged; permutation is arranged; ascending order is ascending // The next arrangement indicates that there is no other arrangement between this arrangement and the next one. // This requires that this arrangement and the next arrangement have the same prefix as long as possible, that is, the change is limited to the suffix as short as possible. // Worst time complexity O (n ^ 2) space complexity 0 class Solution {public: void nextPermutation (vector <int> & nums) {if (nums. size () = 0) return; int k = nums. size ()-1; int last = k; while (k) {if (nums [k-1] <nums [k]) {while (nums [k-1]> = nums [last]) {last --; // look forward from the back (also from the back)} swap (nums [k-1], nums [last]); break;} else {k -- ;}} sort (nums. begin () + k, nums. end ();} private: void swap (int & a, int & B) {int t = a; a = B; B = t ;}};