[Leetcode]Permutation Sequence
来源:互联网 发布:血源诅咒dlc武器数据 编辑:程序博客网 时间:2024/05/21 22:51
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.
每个相同的起始元素对应(n-1)!个permutation,只要当前的k进行(n-1)!取余,得到的数字就是当前剩余数组的index,如此就可以得到对应的元素, 递推直到数组中没有元素结束~
class Solution: # @return a string def getPermutation(self, n, k): factorial = 1; res = "" for i in xrange(2, n): factorial *= i num = [i for i in xrange(1, n + 1)] k -= 1 for i in reversed(xrange(n)): res += str(num[k / factorial]) del num[k / factorial] if i > 0: k %= factorial factorial /= i return res
0 0
- LeetCode: Permutation Sequence
- LeetCode Permutation Sequence
- [Leetcode] Permutation Sequence
- [LeetCode] Permutation Sequence
- leetcode 74: Permutation Sequence
- leetcode Permutation Sequence
- [leetcode] Permutation Sequence
- [LeetCode]Permutation Sequence
- LeetCode:Permutation Sequence
- LeetCode-Permutation SequencePermutation Sequence
- [leetcode] Permutation Sequence
- LeetCode - Permutation Sequence
- LeetCode:Permutation Sequence
- LeetCode 60: Permutation Sequence
- Leetcode: Permutation Sequence
- leetcode Permutation Sequence
- LeetCode | Permutation Sequence
- LeetCode Permutation Sequence
- Hash散列存储
- DOM解析XML(三)
- Android4.4 wpa_supplicant深入分析之wpa_supplicant初始化流程
- IOS 自动布局指南3:约束在界面生成器内是如何工作的
- MySQL中文乱码问题一点笔记
- [Leetcode]Permutation Sequence
- Oracle判断字符串合法性
- DbVisualizer Personal 显示中文问题
- Oracle EBS使用adpatch工具打patch过程(hotpatch mode)
- Switch语句
- javah提示无法访问android.support.v7.app.ActionBarActivity
- 压控恒流源电路设计
- iOS开发-ipa打包终极教程-使用终端和shell脚本实现
- C#正则表达式