N-Queens N皇后问题

1. N-Queens N皇后问题，暴力搜索法即可

#include
#include
using namespace std;
int n = 8;
struct pos
{
int x;
int y;
};
bool isValid(vector<vector> &queens, int row, int col)
{
for (int i = 0; i < queens.size(); i++)
{
if (queens[i][col] == 1)
{
return false;
}
}
for (int i = 0; i < queens.size(); i++)
{
if (queens[row][i] == 1)
{
return false;
}
}
for (int i = row, j = col; i >= 0 && j >= 0; i–, j–)
{
if (queens[i][j] == 1)
{
return false;
}
}
for (int i = row, j = col; i <queens.size() && j < queens.size(); i++, j++)
{
if (queens[i][j] == 1)
{
return false;
}
}

for (int i = row, j = col; i >=0 && j < queens.size(); i--, j++)
{
	if (queens[i][j] == 1)
	{
		return false;
	}
}
for (int i = row, j = col; j >= 0 && i < queens.size(); i++, j--)
{
	if (queens[i][j] == 1)
	{
		return false;
	}
}
return true;

}
vector<vector> posvec;
void jisuan(vector<vector> &queens, int currow, vector &pos)
{
if (currow == queens.size())
{
posvec.push_back(pos);
return;
}
for (int i = 0; i < queens.size(); i++)
{
if (isValid(queens, currow, i ))
{
queens[currow][i] = 1;
pos.push_back({ currow,i });
jisuan(queens, currow + 1, pos);
pos.pop_back();
queens[currow][i] = 0;
}
}
}
int main()
{
vector res;
vector<vector> queens(n, vector(n, 0));
vector pos;
jisuan(queens, 0, pos);
cout << posvec.size() << endl;
system(“pause”);
return 0;
}