[Leetcode 67] 31 Next Permutation

Problem:

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 we need to find the first pair that A_i-1 < A_i, and then find the minimum element that is great than A_i-1 from A_i to A_end

swap A_i-1 and A_min_max.

at last, sort all the elements of A_i to A_end.

Then we can get the answer.

Code:

class Solution {
public:
    void nextPermutation(vector<int> &num) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int i, min_max;
        for (i=min_max=num.size()-1; i>0; i--) {
            if (num[i] > num[min_max])
                min_max = i;
            
            if (num[i] > num[i-1])
                break;
        }
        
        if (i == 0)
            reverse(num.begin(), num.end());
        else {
            for (int j=i; j<num.size(); j++) {
                if (num[j] > num[i-1] && num[j] <= num[min_max])
                    min_max = j;
            }
            
            swap(num[i-1], num[min_max]);
            
            sort(num.begin()+i, num.end());
        }
    }
    
    void swap(int &a, int &b) {
        int tmp = a;
        a = b;
        b = tmp;
    }
};