二维数组解皇后问题
在网上看到的解法大都是一维数组,但看到该题的第一想法是用二维数组,尝试后输出不对,有没有佬看看是哪里出了问题
#include <iostream>
using namespace std;
const int N = 11;
char path[N][N];
bool state[N * 2][N * 2];
int n;
void dfs(int u)
{
if (u > n) {
for (int i = 1; i <= n; i ++){
for (int j = 1; j <= n; j ++) cout << path[i][j];
cout << endl;
}
cout << endl;
return;
}
for (int i = 1; i <= n; i ++) {
// for (int j = 1; j <= n; j ++) {
if (!state[u][i]) {
path[u][i] = 'Q';
state[u][i] = 1;
for (int x = 1; x <= n; x ++) {
state[x][x + u - i] = 1;
state[x][-x + u + i] = 1;
state[x][u] = 1;
}
dfs(u + 1);
for (int x = 0; x <= n; x ++) {
state[x][x + u - i] = 0;
state[x][-x + u + i] = 0;
state[x][u] = 0;
}
path[u][i] = '.';
state[u][i] = 0;
}
// }
}
}
int main()
{
cin >> n;
for (int i = 1; i <= n; i ++) {
for (int j = 1; j <= n; j ++) path[i][j] = '.';
}
dfs (1);
return 0;
}
输出如下:
输入
4
输出