编写一个程序,通过填充空格来解决数独问题。
数独的解法需 遵循如下规则:
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。(请参考示例图)
数独部分空格内已填入了数字,空白格用 '.' 表示。
示例:
输入: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"]]
第一次正式接触的 深搜(dfs) 算法题,自己真正写出来的感觉很是奇妙。
大致思路就是:先对数据初始化记录下每行、每列、每块中的空白位置坐标并将数独中已存在的数字对应 line column box 处标记为 true。当进行深搜时,依次从 0->8 将 index+1 填入数独中并设置对应标志,若不满足数独规则则清空对应标志,直至填完最后一个空将 done 变量标记为 true,而后完成搜索。
private final boolean[][] line = new boolean[9][9];
private final boolean[][] column = new boolean[9][9];
private final boolean[][] box = new boolean[9][9];
private final List<int[]> unsets = new LinkedList<>();
private boolean done = false;
public void solveSudoku(char[][] board) {
for (int i = 0; i < 9; ++ i) {
for (int j = 0; j < 9; ++ j) {
if (board[i][j] == '.') {
// 记录空白位置
unsets.add(new int[] {i, j});
} else {
int value = board[i][j]-'1';
line[j][value] = column[i][value] = box[(i/3)*3+j/3][value] = true;
}
}
}
dfs(board, 0);
}
private void dfs(char[][] board, int deep) {
if (deep == unsets.size()) {
done = true;
return;
}
int[] data = unsets.get(deep);
int i = data[0], j = data[1];
for (int index = 0; !done && index < 9; ++ index) {
if (!(line[j][index] || column[i][index] || box[(i/3)*3+j/3][index])) {
line[j][index] = column[i][index] = box[(i/3)*3+j/3][index] = true;
board[i][j] = (char) (49+index);
dfs(board, deep+1);
line[j][index] = column[i][index] = box[(i/3)*3+j/3][index] = false;
}
}
}