Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
43 lines (35 loc) · 986 Bytes

File metadata and controls

43 lines (35 loc) · 986 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package algorithms;
/**
* @Auther: Jesper
* @Date: 2019/2/12 17:23
* @Description: 全排列
*/
public class Permutation {
int count = 0;
public void permutation(char[] cs, int index) {
if (index > cs.length) {
return;
}
if (index == cs.length) {
System.out.println(new String(cs));
count++;
}
for (int i = index; i < cs.length; i++) {
swap(cs, index, i);
permutation(cs, index + 1);
// 再次交换,保持原状
swap(cs, index, i);
}
}
private void swap(char[] cs, int index, int target) {
char tmp = cs[index];
cs[index] = cs[target];
cs[target] = tmp;
}
public static void main(String[] args) {
char[] cs = new char[]{'a', 'b', 'c', 'd'};
Permutation per = new Permutation();
per.permutation(cs, 0);
System.out.println("方法总数:" + per.count);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.