此处引入大神的解答:
判断一个 9x9 的数独是否有效。只需要根据以下规则,验证已经填入的数字是否有效即可。
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。
上图是一个部分填充的有效的数独。
数独部分空格内已填入了数字,空白格用 ‘.’ 表示。
示例 1:
输入:
[
[“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”]
]
输出: true
示例 2:
输入:
[
[“8”,“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”]
]
输出: false
解释: 除了第一行的第一个数字从 5 改为 8 以外,空格内其他数字均与 示例1 相同。
但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。
说明:
一个有效的数独(部分已被填充)不一定是可解的。
只需要根据以上规则,验证已经填入的数字是否有效即可。
给定数独序列只包含数字 1-9 和字符 ‘.’ 。
给定数独永远是 9x9 形式的。
思路:
回溯法,从一条路往前走,能进则进,不能进就后退,换一条路
这个问题的解决方法也是一样的,需要从‘1’到‘9’填数字,满足直接返回true;不满足就回退到‘.’
遍历每一行,每一列,只要是‘.’的,就要尝试填入‘1’到‘9’
注意判断是否是空的条件,首先判断行,i;然后判断列,j;然后判断每个小block是否合法。都判断完毕,就是真正的答案了。
public class Solution {
public void solveSudoku(char[][] board) {
if(board == null||board.length==0)
return ;
helper(board);
}
private boolean helper(char[][] board){
for(int i=0;i<board.length;i++){
for(int j=0;j<board[0].length;j++){
if(board[i][j]=='.'){
for(char num = '1';num<='9';num++){
if(isValid(board,i,j,num)){
board[i][j]=num;
if(helper(board)){
return true;
}else{
board[i][j]='.';
}
}
}
return false;//全部放过后还是没有正确的
}
}
}
return true;//全部遍历后找不到有‘.’的,都写完啦,说明对了
}
private boolean isValid(char[][] board,int i,int j,char c){
for(int row=0;row<9;row++){//行是否合法
if(board[row][j]==c)
return false;
}
for(int col=0;col<9;col++){//列是否合法
if(board[i][col]==c)
return false;
}
for(int row=i/3*3;row<i/3*3+3;row++){//小的block是否合法
for(int col=j/3*3;col<j/3*3+3;col++){
if(board[row][col]==c)
return false;
}
}
return true;
}
}