首页 > 代码库 > [LeetCode] Permutation Sequence
[LeetCode] 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 kth permutation sequence.
Note: Given n will be between 1 and 9 inclusive.
class Solution {public: string getPermutation(int n, int k) { string res; func(res,n,k); return res; }private: void func(string &res,int n,int k){ //n表示几位数 if(n==0) return; int weight = f(n-1); char cur = ‘1‘; int num = (k-1)/weight + 1; while( find(res.begin(),res.end(),cur)==res.end() || num!=0){ if(find(res.begin(),res.end(),cur)==res.end()) num--; if( num != 0) cur += 1; else break; } k %= weight; if(k==0) k = weight; res.push_back(cur); func(res,n-1,k); } int f(int n){ if(n == 1 || n==0) return 1; else return n*f(n-1); }};
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。