Class Solution

LeetCode_problems/Permutation Sequence/Solution.cpp:23–42

class Solution {
public:
    string getPermutation(int n, int k) {
        vector<int > v;
        
        fact[0]=1,fact[1]=1,fact[2]=2;// pre compute factorial
        for(int i=3;i<=n;i++){
            fact[i]=fact[i-1]*i;
        }
        c=0;
        s="";
        for(int i=1;i<=n;i++){ // insert the first permutation in sorted order
            v.push_back(i);
        }
        calc(n,k,n-1,v);
        
        return s;
        
    }
};