leetcode-60 Permutation Sequence

最新推荐文章于 2022-02-11 22:59:16 发布

乐观的大鹏

最新推荐文章于 2022-02-11 22:59:16 发布

阅读量124

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/qq_38340127/article/details/90055701

版权

LeetCode 专栏收录该内容

100 篇文章 0 订阅

订阅专栏

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:

"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.
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"

找出第n个字典排序的数。

生成字典排序直到第n个数的方法如下：

public String getPermutation(int n, int k) {
StringBuffer tmp = new StringBuffer();
   for(int i=1;i<=n;i++) {
   tmp.append(i);
}
   int index=2;
   char[] res = tmp.toString().toCharArray();
   while(index<=k) {
       res = getNext(res);
       index++;
   }

   return new String(res);
}

//字典排序的思想就是从末尾第二个数开始查询再其后面是否有比它大的数据如果有则进行替换然后对其后面的值进行从小到大排序
public char[] getNext(char[] res) {
       for (int index = res.length - 2; index >= 0; index--) {
           for (int j = res.length - 1; j > index; j--) {
               if (res[j] > res[index]) {
                   char temp = res[j];
                   res[j] = res[index];
                   res[index] = temp;
                   Arrays.sort(res, index + 1, res.length);
                   return res;
               }
           }
       }
   return res;
}