leetcode 60 第几个排列

he 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):

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

Given n and k, return the k^th permutation sequence.

Note: Given n will be between 1 and 9 inclusive.

Subscribe to see which companies asked this question

代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
#include<cstring>
#include<vector>
#include<map>
#include<stdlib.h>
string suan(int n, int k)
{
    string ans;
    if(n==0)
        return "";
    int vis[10];
    memset(vis,0,sizeof(vis));
    int f[20];
    f[0]=1;
    f[1]=1;
    for(int i=2; i<=n; i++)
    {
        f[i]=f[i-1]*i;
    }
    k--;
    for(int i=n; i>=1; i--)
    {
        int should;
        should=k/f[i-1];

//        if(k%f[i-1]!=0)
//            should++;

        int j;
        for( j=1; j<=n; j++)
        {
            if(vis[j]==0)
                should--;
            if(should<0)
                break;
        }
        vis[j]=1;
        ans+=(j+'0');
        k%=f[i-1];


    }
    return ans;

}
int main()
{
    int a,b;
    while(cin>>a>>b)
    {
        cout<<suan(a,b)<<endl;
    }
}