【算法】全排列

全排列

给定一个数字n，求出n的所有排列组合

import java.util.Scanner;

public class 排列数字 {

    static int n;
    static boolean[] st = new boolean[10];
    static int[] path = new int[10];

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        n = sc.nextInt();

        dfs(1);
        sc.close();
    }

    static void dfs(int k) {
        if (k == n + 1) {
            for (int i = 1; i <= n; i ++) System.out.print(path[i] + " ");
            System.out.println();
            return;
        }

        for (int i = 1; i <= n; i ++) {
            if (!st[i]) {
                path[k] = i;
                st[i] = true;
                dfs(k + 1);
                st[i] = false;
            }
        }
    }
}