LeetCode 60. Permutation Sequence第k个排列

求第K个排列序列

最新推荐文章于 2020-08-12 10:02:34 发布

原创最新推荐文章于 2020-08-12 10:02:34 发布 · 998 阅读

0 ·

CC 4.0 BY-SA版权

算法同时被 3 个专栏收录

475 篇文章

订阅专栏

c++

265 篇文章

订阅专栏

leetcode

231 篇文章

订阅专栏

本文介绍了一种高效算法来解决求解1到n的数字集合中第k个全排列的问题。通过递减因子和调整剩余元素顺序的方法，避免了全排列枚举，实现了O(n)的时间复杂度。

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.

Three problems:

1. overly dependent on next_permutation, TLE

2. How to rearrange after k/factorial is used

3. k--

Python Version:

class Solution:
    def getPermutation(self, n, k):
        res = [i+1 for i in range(n)]
        fac = [1 for i in range(n+1)]
        for i in range(2,n+1):
            fac[i] = fac[i-1]*i
        k -= 1
        for i in range(n):
            off,nk = divmod(k,fac[n-1-i])
            num = res[i+off]
            res[i+1:off+i+1] = res[i:i+off]
            res[i] = num
            k = nk
        return ''.join(str(num) for num in res)
s = Solution()
print(s.getPermutation(3, 3))

C++ version:

class Solution {
 public:
  string getPermutation(int n, int k) {
    vector<int> factorial(n, 1);
    string res(n, '1');
    for (int i = 1; i < n; ++i) {
      factorial[i] = factorial[i-1]*i;
      res[i] += i;
    }
    --k;
    for (int i = 0; i < n; ++i) {
      int tmp = k / factorial[n - 1 - i];
      char ch = res[i + tmp];
      for (int j = tmp + i; j > i; --j)
        res[j] = res[j - 1];
      res[i] = ch;
      k = k % factorial[n - 1 - i];
    }
    return res;
  }
};