[leetcode]60. Permutation Sequence@Java解题报告

https://leetcode.com/problems/permutation-sequence/description/

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.

解法：

在n!个排列中，第一位的元素总是(n-1)!一组出现的，也就说如果p = k / (n-1)!，那么排列的最开始一个元素一定是nums[p]。

假设有n个元素，第K个permutation是
a1, a2, a3, .....   ..., an
那么a1是哪一个数字呢？
那么这里，我们把a1去掉，那么剩下的permutation为
a2, a3, .... .... an, 共计n-1个元素。 n-1个元素共有(n-1)!组排列，那么这里就可以知道
设变量K1 = K
a1 = K1 / (n-1)!
同理，a2的值可以推导为
a2 = K2 / (n-2)!
K2 = K1 % (n-1)!
 .......
a(n-1) = K(n-1) / 1!
K(n-1) = K(n-2) /2!
an = K(n-1)

package go.jacob.day801;

import java.util.ArrayList;
import java.util.List;

/**
 * 60. Permutation Sequence
 * @author Jacob
 *
 */
public class Demo1 {

	public String getPermutation(int n, int k) {
		// 存储阶乘
		int[] factorial = new int[n + 1];
		factorial[0] = 1;
		int sum = 1;
		for (int i = 1; i <= n; i++) {
			sum *= i;
			factorial[i] = sum;
		}
		// 如果k越界，返回null
		if (k > factorial[n])
			return null;
		System.out.println("lalal");
		List<Integer> list = new ArrayList<Integer>();
		for (int i = 0; i < n; i++)
			list.add(i + 1);
		StringBuilder sb = new StringBuilder();
		for (int i = 1; i <= n; i++) {
			int index = (k - 1) / factorial[n - i];
			sb.append(list.get(index));
			list.remove(index);
			k = k - index * factorial[n - i];
		}

		return sb.toString();
	}
}