leetcode Permutation Sequence

Permutation Sequence

My Submissions
Total Accepted: 40746  Total Submissions: 174549  Difficulty: Medium

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):

  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.

Show Tags
Show Similar Problems
Have you met this question in a real interview? 
Yes
 
No



class Solution {
public:
    string searchNum(vector<bool> &signal, int count, string res)
{
	char temp;
	int i = 1;
	for (i; i < signal.size() && count >= 0; i++)
	{
		if (signal[i] == false)
			count--;
	}
	signal[i-1] = true;
	temp = i-1 + 48;
	res += temp;
	return res;
}
string getPermutation(int n, int k)
{
	vector<int> njie;
	int count = 0;
	njie.push_back(1);
	vector<bool> nsignal;
	nsignal.push_back(false);
	for (int i = 1; i <= n; i++)
	{
		njie.push_back(njie[i - 1] * i);
		nsignal.push_back(false);
	}
		
	string result = "";
	k--;//此处特别特别重要,因为所有的都是从0开始计算,所以k要减1
	int q = n - 1;
	while (q>=0)
	{
		count = k / njie[q];
		k = k%njie[q];
		q--;
		result = searchNum(nsignal, count, result);
	}
	return result;

}

};


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值