经典问题：解数独

题目

编写一个程序，通过填充空格来解决数独问题。

数独的解法需 遵循如下规则：

数字 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”]]
解释：输入的数独如上图所示，唯一有效的解决方案如下所示：

提示：

board.length == 9
board[i].length == 9
board[i][j] 是一位数字或者 ‘.’
题目数据 保证 输入数独仅有一个解

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/sudoku-solver
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

解答

class Solution {
    public void solveSudoku(char[][] board) {

        //先输入初始情况
        //数独分三种情况初始化，方便以后的判断
        boolean[][] row = new boolean[9][9]; //行
        boolean[][] col = new boolean[9][9]; //列
        boolean[][] block = new boolean[9][9]; //块

        for(int i = 0; i < 9; i ++){
            for(int j = 0; j < 9; j ++){
                if(board[i][j] != '.'){
                    int num = board[i][j] - '1';//这里是字符的减法
                    row[i][num] = true;
                    col[j][num] = true;
                    block[i / 3 * 3 + j / 3][num] = true;
                }
            }
        }

        dfs(board, row, col,block, 0, 0);
    }

    //这里采用深度优先算法来解决
    private boolean dfs(char[][] board, boolean[][] row, boolean[][] col, boolean[][] block, int i, int j){
        //结束条件
        while(board[i][j] != '.'){
            //9个一轮回
            if(++ j >= 9){
                ++ i;
                j = 0;
            }
            //说明全部搜索完成了
            if(i >= 9){
                return true;
            }
        }

        //下面是算法的精髓之处，利用回溯来解决
        for(int num = 0; num < 9; num ++){
            int blockIndex = i / 3 * 3 + j / 3; //定位所在块的位置
            if(!row[i][num] && !col[j][num] && !block[blockIndex][num]){
                board[i][j] = (char)('1' + num); //注意，前面如果没有加char那么是有问题的就是‘1’转化为ASCII码和num相加了
                row[i][num] = true;
                col[j][num] = true;
                block[blockIndex][num] = true;
                if(dfs(board, row, col,block, i, j)){
                    return true;
                }else{
                    //这里失败了就需要进行回溯
                    board[i][j] = '.';
                    row[i][num] = false;
                    col[j][num] = false;
                    block[blockIndex][num] = false;
                }
            }

        }

        return false;
    }
}