N皇后问题的java解法

import java.util.Scanner;
public class Solution{
    static int N=20;
    static char[][] path=new char[N][N];
    static boolean[] col = new boolean[N],dg = new boolean[N],udg = new boolean[N];
    static int n=0;
    public static void dfs(int u){
      if(u==n){
          for(int i=0;i<n;i++){
              for(int j=0;j<n;j++)
                  System.out.print(path[i][j]+" ");
                  System.out.println();
          }
       
      } 
      else
          for(int i=0;i<n;i++){
              if(!col[i] && !dg[u+i] && !udg[n-u+i]){
              path[u][i]='Q';
              col[i]=dg[u+i]=udg[n-u+i]=true;
              dfs(u+1);
              path[u][i]='*';
              col[i]=dg[u+i]=udg[n-u+i]=false;
            }
         }
    }
    public static void main(String[] args){
        Scanner sc=new Scanner(System.in);
        n=sc.nextInt();
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
                path[i][j]='*';
        dfs(0);
    }
}