Permutation Sequence, Solution
摘要：
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 s 阅读全文
posted @ 2013-04-15 07:29 Step-BY-Step 阅读(211) 评论(0) 推荐(0) 编辑
