AcWing 842. 排列数字 -- java 语言
原题链接
简单
作者:
dotasf
,
2025-02-07 16:38:22
,
所有人可见
,
阅读 1
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
public class Main {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
static StreamTokenizer st = new StreamTokenizer(br);
static int N = 10;
static int n;
static int[] path = new int[N];
static boolean[] visited = new boolean[N];
static void dfs(int u) {
if (u == n) {
for (int i = 0; i < n; i++) System.out.print(path[i] + " ");
System.out.println();
return;
}
for (int i = 1; i <= n; i++) {
if (!visited[i]) {
path[u] = i;
visited[i] = true;
dfs(u + 1);
visited[i] = false;
}
}
}
public static void main(String[] args) throws IOException {
st.nextToken(); n = (int)st.nval;
dfs(0);
}
}