The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.
Given an integer n, return all distinct solutions to the n-queens puzzle.
Each solution contains a distinct board configuration of the n-queens’ placement, where 'Q'
and '.'
both indicate a queen and an empty space respectively.
For example,
There exist two distinct solutions to the 4-queens puzzle:
[
[".Q..", // Solution 1
"...Q",
"Q...",
"..Q."],
["..Q.", // Solution 2
"Q...",
"...Q",
".Q.."]
]
解决思路:直接检查每个位置
class Solution {
public:
vector<vector<string>> solveNQueens(int n) {
vector<vector<string>> res;
vector<string> queens(n, string(n,'.'));
solveNQueens(res, queens, 0, n);
return res;
}
private:
void solveNQueens(vector<vector<string>> &res, vector<string>& queens,int row, int n){
if(row == n)
{
res.push_back(queens);
return;
}
for(int col = 0; col < n; col++)
{
if(IsValid(queens, row, col, n))
{
queens[row][col] = 'Q';
solveNQueens(res, queens, row+1, n);
queens[row][col] = '.';
}
}
}
bool IsValid(vector<string>& queens, int row, int col, int n){
//判断同一行和列、对角线上是否有多个皇后
for(int i = 0; i < row; i++)//列
{
if(queens[i][col] == 'Q')
return false;
}
for(int i = row-1, j = col-1; i>=0 && j>=0; --i,--j)
{
if(queens[i][j] == 'Q')
return false;
}
for(int i = row-1, j = col+1; i>=0 && j<n; --i,++j)
{
if(queens[i][j] == 'Q')
return false;
}
return true;
}
};