51-N皇后
题目链接:LeetCode-51困难
思考:
皇后们的约束条件:
1.不能同行
2.不能同列
3.不能同斜线
class Solution {
public:
vector<vector<string>> solveNQueens(int n) {
result.clear();
vector<string> chessboard(n,string(n,'.'));
backtracking(n,0,chessboard);
return result;
}
private:
vector<vector<string>> result;
void backtracking(int n,int row,vector<string>& chessboard){
if(row==n){
result.push_back(chessboard);
return;
}
for(int col=0;col<n;col++){
if(isValid(row,col,chessboard,n)){
chessboard[row][col]='Q';
backtracking(n,row+1,chessboard);
chessboard[row][col]='.';
}
}
}
bool isValid(int row,int col,vector<string>& chessboard,int n){
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>=0;i--,j--){//检查45°
if(chessboard[i][j]=='Q')
return false;
}
for(int i=row-1,j=col+1;i>=0&&j<n;i--,j++){//检查135°
if(chessboard[i][j]=='Q')
return false;
}
return true;
}
};
37-解数独
题目链接:[LeetCode-37](https://leetcode.cn/problems/sudoku-solver/困难
class Solution {
public:
void solveSudoku(vector<vector<char>>& board) {
backtracking(board);
}
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++) {
if(isValid(i,j,k,board)){
board[i][j]=k;
if(backtracking(board)) return true;
board[i][j]='.';
}
}
return false;
}
}
}
return true;
}
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++){
for(int j=startCol;j<startCol+3;j++){
if(board[i][j]==val)
return false;
}
}
return true;
}
};