目录
题目:
代码(首刷看解析 2024年2月6日):
class Solution {
private:
vector<vector<string>> res;
void backtracking(int n, int row, vector<string>& chessboard) {
if (row == n) {
res.push_back(chessboard);
return;
}
for (int col = 0; col < n; ++col) {
if (isValid(row, col, n, chessboard)) {
chessboard[row][col] = 'Q';
backtracking(n, row + 1, chessboard);
chessboard[row][col] = '.';
}
}
return;
}
bool isValid(int row, int col, int n, vector<string>& chessboard) {
/*检查列*/
for (int i = 0; i <= row; ++i) {
if (chessboard[i][col] == 'Q') {
return false;
}
}
/*检查右上斜角*/
for (int i = row - 1, j = col + 1; i >=0 && j < n; --i, ++j) {
if(chessboard[i][j] == 'Q'){
return false;
}
}
/*检查左上斜角*/
for (int i = row - 1, j = col - 1; i >= 0 && j >= 0; --i, --j) {
if(chessboard[i][j] == 'Q'){
return false;
}
}
return true;
}
public:
vector<vector<string>> solveNQueens(int n) {
vector<string> chessboard(n, string(n, '.'));
backtracking(n, 0, chessboard);
return res;
}
};
代码(二刷自解 2024年3月8日)
写的好丑,backtracking里面放if(check){}代码可以精简很多
class Solution {
public://回溯
vector<vector<string>> result;
// 检验合法性
bool check(const vector<vector<char>>& board, int row, int column) {
// 检验行
int n = board.size();
for (int i = 0; i < n; ++i) {
if (board[i][column] == 'Q') return false;
}
// 检验列
for (int i = 0; i < n; ++i) {
if (board[row][i] == 'Q') return false;
}
// 检验左上
for (int i = row, j = column; i >= 0 && j >= 0; --i,--j) {
if (board[i][j] == 'Q') return false;
}
// 检验右上
for (int i = row, j = column; i < n && j >= 0; ++i, --j) {
if (board[i][j] == 'Q') return false;
}
// 检验左下
for (int i = row, j = column; i >= 0 && j < n; --i, ++j) {
if (board[i][j] == 'Q') return false;
}
// 检验右下
for (int i = row, j = column; i < n && j < n; ++i, ++j) {
if (board[i][j] == 'Q') return false;
}
return true;
}
void backtracking(vector<vector<char>>& board, int n, int row) {
// 终止条件 N个皇后全部放入
if (row == n) {
vector<string> res;
for (int i = 0; i < n; ++i) {
string str = "";
for (int j = 0; j < n; ++j) {
str += board[i][j];
}
res.push_back(str);
}
result.push_back(res);
return;
}
//遍历 note:大小n i表示放在哪一列
for (int i = 0; i < n; ++i) {
// 检查合法性 合法放皇后 不合法 continue剪枝;
if (!check(board, row, i)) continue;
board[row][i] = 'Q';
// 递归
backtracking(board, n, row + 1);
// 回溯
board[row][i] = '.';
}
}
vector<vector<string>> solveNQueens(int n) {
vector<vector<char>> board(n, vector<char>(n, '.'));
backtracking(board, n, 0);
return result;
}
};
代码(三刷看了眼思路 2024年5月23日 代码简洁版)
这一版代码就很美,C++写的代码确实好看呀
class Solution {
public:
vector<vector<string>> solveNQueens(int n) {
res.clear();
board = vector<string>(n,string(n,'.'));
backtracking(board, 0);
return res;
}
private:
void backtracking(vector<string>& board, int row) {
if (row == board.size()) {
res.push_back(board);
return;
}
for (int i = 0; i < board.size(); i++) {
if (check(board, row, i)) {
board[row][i] = 'Q';
backtracking(board, row + 1);
board[row][i] = '.';
}
}
}
bool check(vector<string>& board, int row, int col) {
// 检查row,col的正上方,左上方,右上方是否有Q
for (int i = 1; i <= row; i++) {
if (board[row - i][col] == 'Q') return false;
if (col - i >= 0 && board[row - i][col - i] == 'Q') return false;
if (col + i < board.size() && board[row - i][col + i] == 'Q') return false;
}
return true;
}
private:
vector<vector<string>> res;
vector<string> board;
};