package com.simple;
import java.util.Scanner;
public class Permutation {
static int max = 100;
static int[] ans = new int[1 << max];
static boolean[] bl = new boolean[21];
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
f(n, 0);
}
private static void f(int n, int cnt) {
if (n == cnt) {
for (int i = 0; i < n; i++) {
System.out.print(ans[i] + " ");
}
System.out.println();
} else {
for (int i = 0; i < n; i++) {
if (bl[i] == false) {
ans[cnt] = i;
bl[i] = true;
f(n, cnt + 1);
bl[i] = false;
}
}
}
}
}
输出全排列(java)
最新推荐文章于 2023-03-19 18:41:35 发布