AcWing 823. 排列 (Java需要IO流快写
原题链接
简单
作者:
JustDoIt11
,
2023-11-21 16:16:32
,
所有人可见
,
阅读 48
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.util.HashSet;
import java.util.Scanner;
class Main {
static int n;
static BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out)); // 快写 (输出超过十万 10^5 的时候用
static boolean[] st = new boolean[20];
static int[] q = new int[20];
public static void dfs(int u) throws IOException {
if (u == n + 1) {
for (int i = 1; i <= n; i ++ )
out.write(q[i] + " ");
out.write("\n");
return ;
}
for (int i = 1; i <= n; i ++) {
if (!st[i]) {
q[u] = i;
st[i] = true;
dfs(u + 1);
st[i] = false;
}
}
}
public static void main(String[] args) throws IOException {
Scanner sc = new Scanner(System.in);
n = sc.nextInt();
dfs(1);
out.close();
}
}