37. 解数独

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

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

1. 数字 1-9 在每一行只能出现一次。
2. 数字 1-9 在每一列只能出现一次。
3. 数字 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] 是一位数字或者 '.'
• 题目数据 保证 输入数独仅有一个解

解题思路 

        本文思想会利用36. 有效的数独_Shaco#的博客-CSDN博客 里面的思想。本题要求我们填数独，最重要的就是当我们填写某个位置的时候要知道她还能填几，要分情况，就类似于一棵树，所以我们采用dfs搜索的方式。首先定义三个bool数组row，col，cell来对应三个规则。先遍历整个表一次，根据表里面已经有数据的位置将对应的bool数组置为true，随后开始dfs

        dfs部分是一个递归的函数，输入参数要包含对应的位置，函数的主要功能就是确定这个位置有没有符合规则的数填进去，没有则说明数独无解，否则就填入数据并更改对应的bool值

class Solution {
public:
    bool row[9][9], col[9][9], cell[3][3][9];  //行、列、九宫格数组，表示0-8有没有被使用
        void solveSudoku(vector<vector<char>>& board) {
            memset(row, 0, sizeof row);
            memset(col, 0, sizeof col);
            memset(cell, 0, sizeof cell);
            //将有数字的位置结合其位置上的数字记录到bool数组中
            for(int i = 0;i < 9; i++) 
                for(int j = 0;j < 9;j++)
                    if(board[i][j] != '.'){
                        int t = board[i][j] - '1'; //转换为bool数组的下标
                        row[i][t] = col[j][t] = cell[i / 3][j / 3][t] = true;
                        //i,j对应的小九宫格中的坐标为i / 3,j / 3.
                    }
           dfs(board, 0, 0);
    }
    bool dfs(vector<vector<char>>& board, int x, int y){
        //x是行坐标，y是列坐标，遍历方式是从左到右，从上到下
        if(y == 9) x++, y = 0;  //这个时候相当于到了最右边，应当换为下一行
        if(x == 9) return true; //说明行x也填完了，数组填写完成
        if(board[x][y] != '.') return dfs(board, x, y + 1); 
        //说明这个位置已经有数了，进入下一个位置
        for(int i = 0;i < 9;i++)
            if(!row[x][i] && !col[y][i] && !cell[x / 3][y / 3][i]){//这个数满足规则
                board[x][y] = '1' + i; //数字下标+1转化为填入数独的数字
                row[x][i] = col[y][i] = cell[x / 3][y / 3][i] = true;
                if(dfs(board, x, y + 1)) return true;  //判断下一个位置
                else{
                    board[x][y] = '.' ; //回溯，恢复现场
                    row[x][i] = col[y][i] = cell[x / 3][y / 3][i] = false;
                }
            }
            return false;
    }
};