51.N皇后
leetcode链接:51. N 皇后 - 力扣(LeetCode)
文章讲解:代码随想录 (programmercarl.com)
视频讲解:这就是传说中的N皇后? 回溯算法安排!| LeetCode:51.N皇后_哔哩哔哩_bilibili
题目代码
class Solution {
public:
vector<vector<string>> solveNQueens(int n) {
result.clear();
vector<string> chessBoard(n, string(n,'.'));
backtracking(n, 0, chessBoard);
return result;
}
private:
void backtracking(int n, int row, vector<string>& chessBoard)//row:行,递归次数
{
if (row == n)
{
result.push_back(chessBoard);
return;
}
for (int col = 0; col < n; col++)
{
if (isValid(chessBoard, row, col, n))
{
chessBoard[row][col] = 'Q';
backtracking(n, row + 1, chessBoard);
chessBoard[row][col] = '.';
}
}
}
bool isValid(vector<string>& chessBoard,int row,int col,int n)
{
//检查列
for (int i = 0; i < row; i++)
{
if (chessBoard[i][col] == 'Q')
return false;
}
//45°角
for (int i = row - 1, j = col - 1; i >= 0 && j >= 0; i--, j--)
{
if (chessBoard[i][j] == 'Q')
return false;
}
//135°角
for (int i = row - 1, j = col + 1; i >= 0 && j < n; i--, j++)
{
if (chessBoard[i][j] == 'Q')
return false;
}
return true;
}
private:
vector<vector<string>> result;
};
37. 解数独
leetcode题目链接:37. 解数独 - 力扣(LeetCode)
文章讲解:代码随想录 (programmercarl.com)
视频讲解:回溯算法二维递归?解数独不过如此!| LeetCode:37. 解数独_哔哩哔哩_bilibili
题目代码
class Solution {
private:
bool backtracking(vector<vector<char>>& board) {
for (int i = 0; i < board.size(); i++) { // 遍历行
for (int j = 0; j < board[0].size(); j++) { // 遍历列
if (board[i][j] == '.') {
for (char k = '1'; k <= '9'; k++) { // (i, j) 这个位置放k是否合适
if (isValid(i, j, k, board)) {
board[i][j] = k; // 放置k
if (backtracking(board)) return true; // 如果找到合适一组立刻返回
board[i][j] = '.'; // 回溯,撤销k
}
}
return false; // 9个数都试完了,都不行,那么就返回false
}
}
}
return true; // 遍历完没有返回false,说明找到了合适棋盘位置了
}
bool isValid(int row, int col, char val, vector<vector<char>>& board) {
for (int i = 0; i < 9; i++) { // 判断行里是否重复
if (board[row][i] == val) {
return false;
}
}
for (int j = 0; j < 9; j++) { // 判断列里是否重复
if (board[j][col] == val) {
return false;
}
}
int startRow = (row / 3) * 3;
int startCol = (col / 3) * 3;
for (int i = startRow; i < startRow + 3; i++) { // 判断9方格里是否重复
for (int j = startCol; j < startCol + 3; j++) {
if (board[i][j] == val ) {
return false;
}
}
}
return true;
}
public:
void solveSudoku(vector<vector<char>>& board) {
backtracking(board);
}
};