【LeetCode】60. Permutation Sequence

题目：

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:

1. "123"
2. "132"
3. "213"
4. "231"
5. "312"
6. "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和k，输出n个数的全排列中第k个全排列

 

分析：

直接调用next_permutation，不过时间复杂度略高，

应该有多项式级别的方法，

 

代码：（指数级别时间复杂度）

class Solution {
public:
	string getPermutation(int n, int k) {
		vector<int> num;
		for (int i = 0; i < n; ++ i) {
			num.push_back(i + 1);
		}
		while (-- k) {
			next_permutation(num.begin(), num.end());
		}
		string result;
		for (int i = 0; i < n; ++ i) {
			result.push_back('0' + num[i]);
		}
		return result;
	}
};