蓝桥杯DFS水题：2n皇后(java实现)

很简单的水题，可以复习一下DFS

import java.util.Scanner;

public class Main {
    //先考虑白皇后
    static int[][] maze = new int[50][50];
    static int[] wh_col = new int[50];static int[] wh_posd = new int[100];static int[] wh_nd = new int[100];
    static int[] bl_col = new int[50];static int[]  bl_posd = new int[100];static int[] bl_nd = new int[100];
    static int wh_cnt = 0;static int bl_cnt = 0;static int N;static int solu_cnt = 0;



    public static void dfs(int l)
    {
        if(l==N){
            b_dfs(0);
            return;
        }
        for(int i=0;i<N;i++){
            if(wh_col[i]!=0||wh_posd[l+i]!=0||wh_nd[N-1-i+l]!=0||maze[l][i]==0)
                continue;
            wh_col[i]=1;wh_posd[l+i]=1;wh_nd[N-1-i+l]=1;maze[l][i]=0;
            dfs(l+1);
            wh_col[i]=0;wh_posd[l+i]=0;wh_nd[N-1-i+l]=0;maze[l][i]=1;
        }

    }
    public static void b_dfs(int l)
    {
        if(l==N){
            solu_cnt++;
            return;
        }
        for(int i=0;i<N;i++){
            if(bl_col[i]!=0||bl_posd[l+i]!=0||bl_nd[N-1-i+l]!=0||maze[l][i]==0)
                continue;
            bl_col[i]=1;bl_posd[l+i]=1;bl_nd[N-1-i+l]=1;maze[l][i]=0;
            b_dfs(l+1);
            bl_col[i]=0;bl_posd[l+i]=0;bl_nd[N-1-i+l]=0;maze[l][i]=1;
        }

    }
    public static void main(String[] args)
    {
        Scanner in = new Scanner(System.in);
        N  = in.nextInt();
        for(int i=0;i<N;i++){
            for(int j=0;j<N;j++){
                maze[i][j]=in.nextInt();
            }
        }
        dfs(0);
        System.out.println(solu_cnt);
    }
}