Leetcode每日一题——7. 解数独

题目链接：

力扣

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

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

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

解析：

这道题可以用递归回溯法求解。用2个for来分别控制行和列，这样就锁定了一个位置，再对这个位置这个位置填的数字进行递归回溯选择。把题目转化为树型结构会更好理解：

套用递归四部曲：

递归作用：每次在board上填一个空，直到填完

递归参数：board意义同题意

终止条件：数独填完最后一个空

单层逻辑：从1取到9，判断哪个数字可以填在目前的位置，填好之后填下一格

代码如下：

class Solution {

    boolean flag = false;
    boolean isValid(char[][] board, int x, int y,char value){//判断第x行第y列能不能填value
        for(int i = 0; i < board[x].length; i++)//判断行
            if(board[x][i] == value) return false;
        for(int i = 0; i < board.length; i++)//判断列
            if(board[i][y] == value) return false;
        int row = (x / 3) * 3, col = (y / 3) * 3;//九宫格的行和列
        for(int i = row; i < row + 3; i++)
            for(int j = col; j < col + 3; j++)
                if(board[i][j] == value) return false;
        return true;
    }

    public void solveSudoku(char[][] board) {
        //递归作用：每次在board上填一个空，直到填完
        //递归参数：board意义同题意
        //终止条件：数独填完最后一个空
        //单层逻辑：从1取到9，判断哪个数字可以填在目前的位置，填好之后填下一格
        for(int i = 0; i < board.length; i++){//控制行
            for(int j = 0; j < board[i].length; j++){//控制列
                if(board[i][j] != '.') continue;
                for(char num = '1'; num <= '9'; num++){//对每个位置的取值1-9尝试填入
                    if(isValid(board, i, j, num)){
                        board[i][j] = num;
                        solveSudoku(board);
                        if(flag == true) return;
                        board[i][j] = '.';//回溯，初始化状态量
                    }
                }
                return;//如果9个数都不行，说明这个棋盘不行，得回溯到上一层，让上一层填别的数。这一点很重要
            }
        }
        flag = true;
    }
}