permutation-sequence

题目：

The set[1,2,3,…,n]contains a total of n! unique permutations.
By listing and labeling all of the permutations in order,
We get the following sequence (ie, for n = 3):
“123”
“132”
“213”
“231”
“312”
“321”

Given n and k, return the k th permutation sequence.
Note: Given n will be between 1 and 9 inclusive.

程序：

class Solution {
public:
    string getPermutation(int n, int k) {
        string res;
        for (int i = 0; i < n; i++)
            dict.push_back(i + 1);
        solve(res, n, k);
        return res;
    }

    void solve(string &res, int n, int k)
    {
        if (k == 0)
        {
            for (int i = dict.size() - 1; i >= 0; i--)
            {
                res.push_back(dict[i] +'0');

            }
            return;
        }

        int num = 1;
        for (int i = 1; i < n; i++)
            num = num * i;
        int m = k / num;//商
        k = k%num;//余数
        if (k)//余数为0时应该是属于下一层
        {
            res.push_back(dict[m] + '0');
            auto it = dict.begin() + m;
            dict.erase(it);
        }
        else
        {
            res.push_back(dict[m-1] + '0');
            auto it = dict.begin() + m-1;
            dict.erase(it);
        }

        solve(res, n - 1, k);
    }

    vector<int>  dict;
};

点评：

此题采用全排列会超时，找规律，求解子问题，采用递归