forked from leetcoders/LeetCode-Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPermutationSequence.java
More file actions
70 lines (69 loc) · 2.04 KB
/
PermutationSequence.java
File metadata and controls
70 lines (69 loc) · 2.04 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
/*
Author: King, wangjingui@outlook.com
Date: Dec 20, 2014
Problem: Permutation Sequence
Difficulty: Medium
Source: https://oj.leetcode.com/problems/permutation-sequence/
Notes:
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 sequence.
Note: Given n will be between 1 and 9 inclusive.
Solution: 1. Brute!
2. combinatorial mathematics.
*/
public class Solution {
public void nextPermutation(char[] num) {
int last = num.length - 1;
int i = last;
while (i > 0 && num[i - 1] >= num [i]) --i;
for (int l = i, r = last; l < r; ++l, --r) {
num[l] = (char) (num[l] ^ num[r]);
num[r] = (char) (num[l] ^ num[r]);
num[l] = (char) (num[l] ^ num[r]);
}
if (i == 0) {
return;
}
int j = i;
while (j <= last && num[i-1] >= num[j]) ++j;
num[i-1] = (char) (num[i-1] ^ num[j]);
num[j] = (char) (num[i-1] ^ num[j]);
num[i-1] = (char) (num[i-1] ^ num[j]);
}
public String getPermutation_1(int n, int k) {
char[] num = new char[n];
for (int i = 0; i < n; ++i) num[i] = (char) (i + '1');
System.out.println(String.valueOf(num));
while (--k != 0) {
nextPermutation(num);
}
return String.valueOf(num);
}
public String getPermutation_2(int n, int k) {
StringBuffer sb = new StringBuffer();
StringBuffer res = new StringBuffer();
int total = 1;
for (int i = 1; i <= n; ++i) {
total = total * i;
sb.append(i);
}
k--;
while(n != 0) {
total = total / n;
int idx = k / total;
res.append(sb.charAt(idx));
k = k % total;
sb.deleteCharAt(idx);
n--;
}
return res.toString();
}
}