DFS模版

import java.util.*;
public class Main {
    private static int n;
    private static int[] path;
    private static boolean[] st;

    public static void dfs(int u) {
        if (u == n) {
            for (int i = 0; i < n; i++) {
                System.out.printf("%5d", path[i]);
            }
            System.out.println();
            return;
        }

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

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        path = new int[n];
        st = new boolean[n + 1];
        dfs(0);
    }
}

P1706 全排列问题 （但是只得了AC了80）