Permutation Sequence

2019独角兽企业重金招聘Python工程师标准>>>

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.

这种方法超时了。

char A[1000];
class Solution {public:void perm(int i , int n , int k,int & count , string &s , bool tag){if(tag)return;if(i == n){count ++;if(count == k){tag = true;s=A;return;}         }for(int j = i ; j < n ; j ++){swap(A[i],A[j]);perm(i + 1 , n , k , count , s,tag);swap(A[i],A[j]);if(tag)break;}}string getPermutation(int n, int k) {// Note: The Solution object is instantiated only once and is reused by each test case.for(int i = 0 ; i< n ; i ++){A[i] = (char)(i + '1');}string s;int count = 0;bool tag = false;perm(0,n,k,count ,s,tag);return s;}
};

重写之后的算法过了

转载于:https://my.oschina.net/liangxiao/blog/168808

Permutation Sequence相关推荐

60 Permutation Sequence
60 Permutation Sequence 题目 The set [1,2,3,-,n] contains a total of n! unique permutations.By listing ...
LeetCode60:Permutation Sequence
The set [1,2,3,-,n] contains a total of n! unique permutations. By listing and labeling all of the p ...
【数字全排列】LeetCode 60. Permutation Sequence
LeetCode 60. Permutation Sequence Solution0: 偷鸡摸狗的做法 class Solution {public:string getPermutation(in ...
[Swift]LeetCode60. 第k个排列 | Permutation Sequence
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ ➤微信公众号:山青咏芝(shanqingyongzhi) ➤博客园地址:山青咏芝(https://www.cnblog ...
康拓编码——Permutation Sequence
描述 2.1.13 Permutation Sequence The set [1,2,3,ĉ ,n] contains a total of n! unique permutations. By l ...
60. Permutation Sequence
一.题目 1.审题 2.分析给两个数字 n 与 k,返回 1-n 所有数字组成的从小到大的全排序的第 k 个数. 二.解答 1.思路: 方法一.采用字典序列,返回全部序列后,输出第 k 个.(时间超 ...
LeetCode Permutation Sequence(求排列中的第k个排列是什么)
思路:使用阶乘,f(n) = f(n -1) * n,在确定第i个数是,用k/f(n - 1 - i) 代码如下: public class Solution {public String getP ...
Leetcode Permutation Sequence
超时算法-排序dfs: class Solution { public: string s; string s1; int count;string getPermutation(int n, int ...
LeetCode刷题（35）--Permutation Sequence
对于第一个数字,剩余共有(n-1)!中排列,因此第一个数字为k/(n-1)!,之后的数字依次类推 import math class Solution(object):def getPermutati ...

Permutation Sequence

Permutation Sequence相关推荐

最新文章

热门文章