衢州学院_手机app下载网_百度搜索关键词数据_网站优化公司

19684递归实现排列枚举

⭐️难度：中等
🌟考点：递归
📖

📚

package test;import java.util.Scanner;public class Main {static boolean[] a;static int[] b;static int n;static void dfs(int x){if(x > n){for (int i = 1; i <= n; i++) {System.out.print(b[i]+" ");}System.out.println();}for (int i = 1; i <= n; i++) {if(!a[i]){a[i] = true;b[x] = i;dfs(x + 1);a[i] = false;}}}public static void main(String[] args) {Scanner sc = new Scanner(System.in );n = sc.nextInt();a = new boolean[n + 1];b = new int[n + 1];dfs(1);}
}

🍎笔记