60 Permutation Sequence

1 题目

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 for n = 3:

1. "123"
2. "132"
3. "213"
4. "231"
5. "312"
6. "321"

Given n and k, return the kth permutation sequence.

Note:

• Given n will be between 1 and 9 inclusive.
• Given k will be between 1 and n! inclusive.

Example 1:

Input: n = 3, k = 3
Output: "213"

Example 2:

Input: n = 4, k = 9
Output: "2314"

2 尝试解

class Solution {
public:
    string getPermutation(int n, int k) {
        int result = 0;
        k --;
        vector<int> saver;
        for(int i = 1; i <= n; i++){
            saver.push_back(i);
        }
        while(saver.size()!= 0){
            int index =  k/factorial(n-1);
            result = result*10 + saver[index];
            saver.erase(saver.begin()+index);
            k = k % factorial(n-1);
            n --;
        }
        return to_string(result);
    }
    int factorial(int n){
        int result = 1;
        if( n == 1 || n==0) return 1;
        while(n > 1){
            result *= n;
            n--;
        }
        return result;
    }
};

3 标准解

string getPermutation(int n, int k) {
    int i,j,f=1;
    // left part of s is partially formed permutation, right part is the leftover chars.
    string s(n,'0');
    for(i=1;i<=n;i++){
        f*=i;
        s[i-1]+=i; // make s become 1234...n
    }
    for(i=0,k--;i<n;i++){
        f/=n-i;
        j=i+k/f; // calculate index of char to put at s[i]
        char c=s[j];
        // remove c by shifting to cover up (adjust the right part).
        for(;j>i;j--)
            s[j]=s[j-1];
        k%=f;
        s[i]=c;
    }
    return s;
}