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
41 lines (32 loc) · 917 Bytes

File metadata and controls

41 lines (32 loc) · 917 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
/**
* 全排列,自我理解算法
*/
public class BackTrace{
private static boolean flag[];
public static void main(String[] args) {
int nums[] = {1, 3};
flag = new boolean[nums.length];
for (int i = 0; i < flag.length; i++) {
flag[i] = true;
}
int tmp[] = new int[nums.length];
backtracking(nums, 0, tmp);
}
private static void backtracking(int nums[], int start, int[] tmp) {
if (start >= nums.length) {
for (int k : tmp) {
System.out.print(k + "");
}
System.out.println();
return;
}
for (int i = 0; i < nums.length; i++) {
if (flag[i]) {
flag[i] = false;
tmp[i] = nums[start];
backtracking(nums, start+1, tmp);
flag[i] = true;
}
}
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.