LeetCode 60: Permutation Sequence
2016-04-04 14:30
369 查看
LeetCode 60: Permutation Sequence
算法思路
已知以每个数字开头的序列个数为(n - 1)!,根据(k - 1) / (n - 1) ! + 1可以知道第一个数字是几,然后递归,求出之后的数字;算法中数组flag记录数字是否被使用,factorials记录阶乘值,如果在递归函数中直接求阶乘会导致超时;
每次递归n的值会减1,递归终止的条件即n为0,此外k的值变为k - position * factorials[n - 1];
代码
public class Solution { public String ret = ""; public String getPermutation(int n, int k) { boolean[] flag = new boolean ; // 0 ~ n - 1 //all haven't been used for (int i = 0; i < flag.length; i++) flag[i] = false; int[] factorials = new int[n + 1]; factorials[0] = 1; for (int i = 1; i <= n; i++) factorials[i] = factorials[i - 1] * i; getPermutation(n, k, flag, factorials); return ret; } public void getPermutation(int n, int k, boolean[] flag, int[] factorials) { if (n == 0) return; int factorial = factorials[n - 1]; int position = (k - 1) / factorial; int count = -1, i; for (i = 0; i < flag.length; i++) { if (!flag[i]) count++; if (count == position) break; } flag[i] = true; ret = ret + (i + 1); getPermutation(n - 1, k - position * factorial, flag, factorials); } }
相关文章推荐
- Android Gradle Plugin指南(五)——Build Variants(构建变种版本)
- Android学习笔记---第三天---基础UI组件---Button&ImageButton
- 62. Unique Paths
- POJ 1679 The Unique MST(判断最小生成树是否唯一)
- 深度学习Deep learning From Image to Sequence
- jquey的 ajax请求的几种方式
- lintcode-medium-Permutation Sequence
- 理解requirejs的几个重要点
- HDU 3726 Graph and Queries(treap)
- Android UI基础——SeekBar&RatingBar控件
- Java基础:StringBuffer与StringBuilder的区别
- 在普通类中获取request和session
- Building Telephony Systems With OpenSIPS---Introduction to SIP
- uedit的简单使用案例
- hdu 1711 Number Sequence
- POJ2479&&POJ2593 Maximum sum&&Max Sequence(最大连续和)
- iOS学习笔记03-UITableView
- iOS学习笔记02-UIScrollView
- 设计模式-builder
- Arduino101 中使用 Mirf 库的问题(2016-04-04)