[leetcode 31] 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

思路：stl中next_permutation的思想.从后往前，找到num[i] < num[i+1], 然后在i+1~n-1之中找到大于num[i]的数中的最小的数num[j], 交换num[i],和num[j]的值，最后将num[i+1]~num[n-1]反向。

class Solution {
public:
    void nextPermutation(vector<int> &num) {
        const int n = num.size();
        int i = 0;
        for (i = n-2; i >=0; i--) {
            if (num[i] < num[i+1]) {
                break;
            }
        }
        if (i < 0) {
            reverse(num, 0, n-1);
            return ;
        }
        int bigger_i = INT_MAX;
        int j = n;
        for (int m = n - 1; m > i; m--) {
            if (num[m] < bigger_i && num[m] > num[i]) {
                bigger_i = num[m];
                j = m;
            }
        }
        swap(num[j],num[i]);
        reverse(num, i+1, n-1);
        return ;
    }
    void reverse(vector<int> &num, int begin, int end) {
        while (begin < end) {
            swap(num[begin++], num[end--]);
        }
    }
};

python

class Solution:
    # @param num, a list of integer
    # @return a list of integer
    def nextPermutation(self, num):
        lens = len(num)
        ind = -1;
        if lens == 1:
            return num
        for i in range(1,lens)[::-1]:
            if num[i-1] < num[i]:
                ind = i - 1
                break
        if ind == -1:
            return num[::-1]
        min_index = lens
        min_v = 1000000
        for i in range(ind+1,lens)[::-1]:
            if num[i] > num[ind] and num[i] < min_v:
                min_index = i
                min_v = num[i]
        num[ind],num[min_index] = num[min_index],num[ind]
        i = ind + 1
        j = lens - 1
        while i < j:
            num[i],num[j] = num[j],num[i]
            i += 1
            j -= 1
        return num