Problem Description
在N*N的方格棋盘放置了N个皇后,使得它们不相互攻击(即任意2个皇后不允许处在同一排,同一列,也不允许处在与棋盘边框成45角的斜线上。
你的任务是,对于给定的N,求出有多少种合法的放置方法。
你的任务是,对于给定的N,求出有多少种合法的放置方法。
Input
共有若干行,每行一个正整数N≤10,表示棋盘和皇后的数量;如果N=0,表示结束。
Output
共有若干行,每行一个正整数,表示对应输入行的皇后的不同放置数量。
Sample Input
1
8
5
0
Sample Output
1
92
10
这道题直接在结果上dfs会TLE,在输入数据之前dfs,用数组把n皇后的结果存起来,可AC。
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int[][] flag = new int[11][11];
int[] haha = new int[11];
for (int i = 1; i <= 10; i++) {
haha[i] = dfs(flag, i, 1);
}
while (sc.hasNextInt()) {
int n = sc.nextInt();
if (n == 0)
break;
System.out.println(haha[n]);
}
}
public static int dfs(int[][] flag, int n, int times) {
int count = 0;
if (times > n)
return 1;
for (int i = 1; i <= n; i++) {
//先把该行数据清0
for (int j = 1; j <= n; j++)
flag[times][j] = 0;
boolean b = judge(flag, n, times, i);
if (b) {
flag[times][i] = 1;
//pp(flag,n);
//System.out.println();
count = count + dfs(flag, n, times + 1);
} else {
continue;
}
}
return count;
}
public static void setFlag(int[][] flag, int n) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
flag[i][j] = 0;
}
}
}
public static boolean judge(int[][] flag, int n, int i, int j) {
for (int k = 1; k <= i; k++) {
for (int l = 1; l <= n; l++) {
double x = (i * 1.0 - k) / (j * 1.0 - l);
if (flag[k][j] == 1 || flag[k][l] == 1 && (x == 1 || x == -1))
return false;
}
}
return true;
}
}
状态压缩
import java.io.BufferedInputStream;
import java.util.Scanner;
public class Main {
public static int count = 0;
public static void main(String[] args) {
Scanner sc = new Scanner(new BufferedInputStream(System.in));
while (sc.hasNextInt()) {
int n = sc.nextInt();
if (n == 0) break;
count=0;
dfs(0, 0, 0, (1 << n) - 1);
System.out.println(count);
}
}
/**
* n皇后
* @param col 列
* @param left_diagonal 对角线,左上到右下
* @param right_diagonal 对角线,右上到左下
* @param n
* @return
*/
public static void dfs(int col, int left_diagonal, int right_diagonal, int n) {
if (n == col) {
count++;
return;
}
//获取当前可以放的点
int point = (~(col | left_diagonal | right_diagonal)) & n;
while (point != 0) {
int lowest = point & (-point);//找出最低位
dfs(col | lowest, (left_diagonal >> 1) | (lowest >> 1), ((right_diagonal << 1) | (lowest << 1)) & n, n);
point = point & (~lowest);//去除最低位
}
}
}