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

思路：对1 2 5 3 2 1，如何找到它next排列呢

1）从右往左，找到第一个打破降序的序号，即不满足num[i]<num[i-1]的i值。如果i大于0，则继续第二步

找到num[2]=5

2）从右往左，找到第一个大于num[i-1]值的序号（肯定存在满足条件的j值，最小的j值取i）

num[3]==3>num[1]==2

3)swap (num[i-1],num[j])

得到序列： 1 3 5 2 2 1

3）反转 5 2 2 1--》（1 2 2 5）

最后的得到序列： 1 3 1 2 2 5

class Solution {
public:
    void swap(int *a,int *b)
    {
        int temp=*a;
        *a=*b;
        *b=temp;
    }
    void nextPermutation(vector<int> &num) {
        int flag=num.size()-1;
        int i;
        for(i=flag;i>0;i--)
            if(num[i]>num[i-1])
                break;        
        if(i>0)
        {
            int j=num.size()-1;
            for(;j>0;j--)
                if(num[j]>num[i-1])
                    break;
                    
            swap(&num[j],&num[i-1]);
            reverse(num.begin()+i,num.end());
        }
        else
            reverse(num.begin(),num.end());
    }
};