n皇后问题,枚举每一个位置放与不放做法的代码(java)
package Main;
import java.awt.*;
import java.io.*;
import java.util.Arrays;
import java.util.Scanner;
public class Main {
static int[][] record = new int[100][100];
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
dfs(n, 0, 0,0);
}
public static void dfs(int n,int x,int y,int s){
if (y == n){
x++;
y = 0;
}
if (x == n){
if (s == n){
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
System.out.print(record[i][j]+" ");
}
System.out.println();
}
}
return;
}
dfs(n,x,y+1,s);
if (check(x,y,n)){
record[x][y] = 1;
dfs(n,x,y+1,s+1);
record[x][y] = 0;
}
}
private static boolean check(int x, int y, int n) {
for (int i = 0; i < x; i++) {
for (int j = 0; j < n; j++) {
if (record[i][j] == 1){
if (j == y || Math.abs(x-i) == Math.abs(y-j)) return false;
}
}
}
for (int j = 0; j < y; j++) {
if (record[x][j]==1){
return false;
}
}
return true;
}
}