LeetCode037之解数独（相关话题：回溯法）

题目描述

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

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

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] 是一位数字或者 '.'
• 题目数据 保证 输入数独仅有一个解

解题思路

• line[i][j] 表示在数独的第 i 行是否已经放置了数字 j+1（因为数组索引是从0开始的，所以对应的数字是 j+1）。
• column[i][j] 表示在数独的第 i 列是否已经放置了数字 j+1。
• block[i][j][k] 表示在数独的第 i 行第 j 列所属的小九宫格（3x3）内是否已经放置了数字 k+1。

代码实现

class Solution {
    // 用于记录每行、每列和每个小九宫格内某个数字是否已经被使用
    private boolean[][] line = new boolean[9][9];
    private boolean[][] column = new boolean[9][9];
    private boolean[][][] block = new boolean[3][3][9];
    private boolean valid = false; // 用于标记是否找到有效解
    private List<int[]> spaces = new ArrayList<int[]>(); // 存储空白位置的列表

    public void solveSudoku(char[][] board) {
        // 初始化line, column和block数组
        for (int i = 0; i < 9; ++i) {
            for (int j = 0; j < 9; ++j) {
                if (board[i][j] == '.') {
                    spaces.add(new int[]{i, j}); // 将空白位置加入列表
                } else {
                    int digit = board[i][j] - '0' - 1; // 获得数字在数组中的索引
                    // 标记数字在对应的行、列和九宫格内已被使用
                    line[i][digit] = column[j][digit] = block[i / 3][j / 3][digit] = true;
                }
            }
        }

        dfs(board, 0); // 从第一个空白位置开始深度优先搜索
    }

    public void dfs(char[][] board, int pos) {
        if (pos == spaces.size()) {
            valid = true; // 如果所有空白位置都填满，标记为找到有效解
            return;
        }

        // 获得当前要处理的空白位置
        int[] space = spaces.get(pos);
        int i = space[0], j = space[1];
        // 尝试在当前位置填入1到9的每个数字
        for (int digit = 0; digit < 9 && !valid; ++digit) {
            // 检查填入该数字是否合法
            if (!line[i][digit] && !column[j][digit] && !block[i / 3][j / 3][digit]) {
                // 填入数字，并在相应的数据结构中标记该数字已被使用
                line[i][digit] = column[j][digit] = block[i / 3][j / 3][digit] = true;
                board[i][j] = (char) (digit + '0' + 1);
                dfs(board, pos + 1); // 递归处理下一个空白位置
                if (!valid) {
                    // 如果当前分支未找到有效解，回溯，撤销之前的操作
                    line[i][digit] = column[j][digit] = block[i / 3][j / 3][digit] = false;
                }
            }
        }
    }
}

总结

• 典型题目解法记住，下次出现类似题目时直接套用
• 还有一种位运算的解法，代码实现过于复杂所以不做阐述