题目:
编写一个程序,通过填充空格来解决数独问题。
数独的解法需 遵循如下规则:
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。(请参考示例图)
数独部分空格内已填入了数字,空白格用 '.' 表示。
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/edc56f476bf6f911dcc06a0367b1b5e8.png#pic_center)
输入:board = [["5","3",".",".","7",".",".",".","."],["6",".",".","1","9","5",".",".","."],[".","9","8",".",".",".",".","6","."],["8",".",".",".","6",".",".",".","3"],["4",".",".","8",".","3",".",".","1"],["7",".",".",".","2",".",".",".","6"],[".","6",".",".",".",".","2","8","."],[".",".",".","4","1","9",".",".","5"],[".",".",".",".","8",".",".","7","9"]]
输出:[["5","3","4","6","7","8","9","1","2"],["6","7","2","1","9","5","3","4","8"],["1","9","8","3","4","2","5","6","7"],["8","5","9","7","6","1","4","2","3"],["4","2","6","8","5","3","7","9","1"],["7","1","3","9","2","4","8","5","6"],["9","6","1","5","3","7","2","8","4"],["2","8","7","4","1","9","6","3","5"],["3","4","5","2","8","6","1","7","9"]]
解释:输入的数独如上图所示,唯一有效的解决方案如下所示:
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/c0c7caefbbb1c69adbed7fa9096e6955.png#pic_center)
思考:
提示:
给定的数独序列只包含数字 1-9 和字符 '.' 。
你可以假设给定的数独只有唯一解。
给定数独永远是 9x9 形式的。
棋盘搜索问题可以使用回溯法暴力搜索,只不过这次我们要做的是二维递归。
怎么做二维递归呢?
例如:77.组合(组合问题),131.分割回文串(分割问题),78.子集(子集问题),46.全排列(排列问题),
以及51.N皇后(N皇后问题),其实这些题目都是一维递归。
N皇后问题 是因为每一行每一列只放一个皇后,只需要一层for循环遍历一行,递归来来遍历列,
然后一行一列确定皇后的唯一位置。
本题就不一样了,本题中棋盘的每一个位置都要放一个数字,并检查数字是否合法,
解数独的树形结构要比N皇后更宽更深。
因为这个树形结构太大了,抽取一部分,如图所示:
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/d697e9e628e22b7adeb803b15550aba9.png#pic_center)
回溯三部曲:
递归函数以及参数
递归函数的返回值需要是bool类型,为什么呢?
因为解数独找到一个符合的条件(就在树的叶子节点上)立刻就返回,相当于找从根节点到叶子节点一条唯一路径,
所以需要使用bool返回值
代码如下:
bool backtracking(vector<vector<char>>& board)
递归终止条件
本题递归不用终止条件,解数独是要遍历整个树形结构寻找可能的叶子节点就立刻返回。
不用终止条件会不会死循环?
递归的下一层的棋盘一定比上一层的棋盘多一个数,等数填满了棋盘自然就终止(填满当然好了,说明找到结果了)
所以不需要终止条件!
那么有没有永远填不满的情况呢?
这个问题我在递归单层搜索逻辑里在来讲!
递归单层搜索逻辑
在树形图中可以看出我们需要的是一个二维的递归(也就是两个for循环嵌套着递归)
一个for循环遍历棋盘的行,一个for循环遍历棋盘的列,一行一列确定下来之后,
递归遍历这个位置放9个数字的可能性!
代码如下:(详细看注释)
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] != '.') continue;
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;
}
注意这里return false的地方,这里放return false 是有讲究的。
因为如果一行一列确定下来了,这里尝试了9个数都不行,说明这个棋盘找不到解决数独问题的解!
那么会直接返回, 这也就是为什么没有终止条件也不会永远填不满棋盘而无限递归下去!
判断棋盘是否合法:
判断棋盘是否合法有如下三个维度:
同行是否重复
同列是否重复
9宫格里是否重复
----------------------------
代码:
class Solution{
public void solveSudoku(char[][] board){
backTracking(board);
}
private boolean backTracking(char[][] board){
for(int i = 0;i<9;i++){
for(int j = 0;j<9;j++){
if(board[i][j]!='.') continue;
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;
}
private boolean isValid(int row,int col,char val,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;
}
}
力扣链接