permutations l

class Solution {
public:
    vector<vector<int>> permute(vector<int>& nums) {
        vector<vector<int>> ret;
        sort(nums.begin(),nums.end());
        int size=nums.size();
        if(size==0) return ret;
        if(size==1){
            ret.push_back(nums);
            return ret;
        }
        int sum=1;
        for(int i=1;i<=size;i++){
            sum*=i;
        }
        ret.push_back(nums);
        int i;
        for(i=1;i<sum;i++){
            int j;
            int m;
            j=size-1;
            while(j>0&&nums[j-1]>=nums[j]) j--;
            m=j;
            while(m<size&&nums[j-1]<nums[m])m++;
            int temp=nums[m-1];
            nums[m-1]=nums[j-1];
            cout<<"HHHH"<<endl;
            nums[j-1]=temp;
            reverse(nums.begin()+j,nums.end());
            cout<<"llll"<<endl;
            ret.push_back(nums);
        }
        return ret;
    }
};