编写一个程序,通过填充空格来解决数独问题。
数独的解法需 遵循如下规则:
- 数字
1-9
在每一行只能出现一次。 - 数字
1-9
在每一列只能出现一次。 - 数字
1-9
在每一个以粗实线分隔的3x3
宫内只能出现一次。(请参考示例图)
数独部分空格内已填入了数字,空白格用 '.'
表示。
示例 1:
输入: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"]] 解释:输入的数独如上图所示,唯一有效的解决方案如下所示:
提示:
board.length == 9
board[i].length == 9
board[i][j]
是一位数字或者'.'
- 题目数据 保证 输入数独仅有一个解
思路:将每一行、每一列和每个三维矩阵中存在的数字分别记录到定义的数组中,每次在(i,j)位置,查询三个数组看数字k是否存在
package five;
public class c7 {
private boolean[][] colused=new boolean[9][10];
private boolean[][] rowused=new boolean[9][10];
private boolean cubeused[][]=new boolean[9][10];
private char [][]board=new char[9][9];
public void solve(char[][] board){
this.board=board;
for (int i=0;i<9;i++){
for (int j=0;j<9;j++){
if (board[i][j]!='.'){
int num=board[i][j]-'0';
colused[j][num]=true;
rowused[i][num]=true;
cubeused[cubenum(i,j)][num]=true;
}
}
}
backdrop(0,0);
}
public boolean backdrop(int row,int col){
while (row<9&&board[row][col]!='.'){
row= col==8?row+1:row;
col= col==8?0:col+1;
}
if (row==9) return true;
for (int k=1;k<=9;k++){
if (colused[col][k]||rowused[row][k]||cubeused[cubenum(row,col)][k]){
continue;
}
colused[col][k]=rowused[row][k]=cubeused[cubenum(row,col)][k]=true;
board[row][col]=(char)(k+'0');
if (backdrop(row,col)) return true;
board[row][col]='.';
colused[col][k]=rowused[row][k]=cubeused[cubenum(row,col)][k]=false;
}
return false;
}
public int cubenum(int i,int j){
i=i/3;
j=j/3;
return i*3+j;
}
}