[LeetCode]Permutation Sequence

class Solution {
//decompose the big problem into smaller problem
private:
	vector<bool> numT;//keep record of number state, choosen or not
	vector<int> factT;//save factorial number
public:
	string getPermutation(int n, int k) {
		// Start typing your C/C++ solution below
		// DO NOT write int main() function
		Init(n);
		string ans;
		getPermutation_Aux(n, k, 1, ans);
		return ans;
	}

	void getPermutation_Aux( int n, int k, int selectNow, string& ans) 
	{
		if(n == 0) return;
		if (factT[n-1] >= k)//then the first digit should be pq.front()
		{
			int now = selectNow;
			ans.append(1, now+'0');
			numT[selectNow] = false;
			selectNow = SelectMin();
			getPermutation_Aux(n-1, k, selectNow, ans);
		}
		else 
		{
			selectNow = MoveForward(selectNow);
			getPermutation_Aux(n, k-factT[n-1], selectNow, ans);
		}
	}

	int SelectMin( ) 
	{
		for(int i = 1; i < numT.size(); ++i)
			if(numT[i]) return i;
		return -1;
	}

	int MoveForward(int startIdx ) 
	{
		for (int i = startIdx+1; i < numT.size(); ++i)
			if(numT[i]) return i;
		return -1;
	}

	void Init( int n ) 
	{
		numT.clear();//very important, without this line, it will be Runtime Error
		factT.clear();//very important, without this line, it will be Runtime Error
		numT.resize(n+1, true);

		int tmp = 1;
		factT.resize(n+1);
		factT[0] = 1;
		for(int i = 1; i <= n; ++i)
		{
			tmp *= i;
			factT[i] = tmp;
		}
	}
};

second time

class Solution {
public:
    map<int, int> facTable;
    void calFacTable(int n, map<int, int>& facTable)
    {
        facTable.clear();
        facTable[0] = 0;
        int curNum = 1;
        for(int i = 1; i < n; i++)
        {
            curNum *= i;
            facTable[i] = curNum;
        }
    }
    void getPermutationUtil(int n, int k, int curIdx, vector<bool>& used, string& path)
    {
        if(curIdx == 0)
        {
            int tmp;
            for(int i = 1; i <= n; ++i)
            {
                if(used[i] == false)
                {
                    tmp = i;
                    break;
                }
            }    
            used[tmp] = true;
            path.push_back(tmp+'0');
            //reverse(path.begin(), path.end());
            return ;
        }
        int curCnt = 0;
        int step = facTable[curIdx];
        for(int i = 1; i <= n; ++i)
        {
            if(used[i] == true) continue;
            
            if(curCnt+step >= k)
            {
                used[i] = true;
                path.push_back(i+'0');
                getPermutationUtil(n, k-curCnt, curIdx-1, used, path);
                break;
            }
            else curCnt += step;
        }
    }
    string getPermutation(int n, int k) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        calFacTable(n, facTable);
        string path;
        vector<bool> used(n+1, false);
        getPermutationUtil(n, k, n-1, used, path);
        return path;
    }
};