/**
* LeetCode60 n个数的排列组合找出第k个排列
* The set[1,2,3,…,n]contains a total of n! unique permutations.
By listing and labeling all ofthe permutations in order,
We getthe following sequence (ie, for n = 3):
"123""132""213""231""312""321"
Given n and k, returnthe k th permutation sequence.
Note: Given n will be between1and9 inclusive.
时间限制:1秒
*/
analysis
At first glance is 1 ~ N N digital full permutation of these
Changes, each line up to a count, the count k is output to the current row number of the good