八皇后问题-DFS深度搜索-递归

import java.util.*;
public class Bahuanghou3 {
    public static int n=0;
    public static int count=0;
    public static void main(String args[]){
        Scanner in=new Scanner(System.in);
        n=in.nextInt();
        int num[][]=new int[n][n];
        for(int i=0;i1 || cnt_col>1){
            return false;
        }
        int zx=row-1,zy=col-1;
        while(zx>=0 && zy>=0){
            if(num[zx][zy]==1){
                return false;
            }
            zx--;
            zy--;
        }
        int yx=row-1,yy=col+1;
        while(yx>=0 && yy