[LeetCode] 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

class Solution {
public:
    void nextPermutation(vector<int> &num) {
        int n = num.size() - 1,i;
        int curMax = num[n],curMin;
        for(i = n - 1;i >= 0;i --){//从后往前遍历，找到比后面的最大元素小的当前元素
            if(num[i] >= curMax){
                curMax = num[i];
                continue;
            }else {
                int idx = i;
                for(int j = n;j >= idx + 1;j --){//从后往前遍历，找到第一个比当前元素大的元素以进行交换
                    if(num[j] > num[idx]){
                        curMin = j;
                        break;
                    }
                }
                int tmp = num[idx];
                num[idx] = num[curMin];
                num[curMin] = tmp;
                sort(num.begin() + idx + 1,num.end());//交换后，即对当前元素后面的所有元素进行升序遍历得到最后结果
                break;
            }
        }
        if(i == -1){
            for(int i = 0;i <= n/2;i ++){
                int tmp = num[i];
                num[i] = num[n - i];
                num[n - i] = tmp;
            }
        }
    }
};