37. 解数独 回溯解法

https://leetcode.cn/problems/sudoku-solver/

题目要求

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

回溯

class Solution {
    private boolean[][] row = new boolean[9][9];// 储存每一行存在的数字
    private boolean[][] col = new boolean[9][9];// 储存 每一列存在的数字
    private boolean[][][] block = new boolean[3][3][9]; // 储存每一个 3*3宫存在的数字
    private List<int[]> location = new ArrayList<>();       // 记录需要填入的数字位置
    private boolean valid = false;  // 用来判断是否填完所有空格

    public void solveSudoku(char[][] board) {
        for (int i = 0; i < 9; i++) {
            for (int j = 0; j < 9; j++) {
                if (board[i][j] == '.')
                    location.add(new int[]{i, j});
                else {
                    int digit = board[i][j] - '0' - 1;
                    row[i][digit] = col[j][digit] = block[i / 3][j / 3][digit] = true;
                }
            }
        }
        backtrack(board, 0);
    }

    public void backtrack(char[][] board, int index) {
        if (index == location.size()) {
            valid = true;
            return;
        }
        int[] space = location.get(index);
        int i = space[0], j = space[1];
        // valid为了剪枝
        for (int k = 0; k < 9 && !valid; k++) {
            // 行、列、方格块中都没有出现数字k
            if (!row[i][k] && !col[j][k] && !block[i / 3][j / 3][k]) {
                row[i][k] = col[j][k] = block[i / 3][j / 3][k] = true;
                board[i][j] = (char) ('0' + k + 1);
                backtrack(board, index + 1);
                row[i][k] = col[j][k] = block[i / 3][j / 3][k] = false;
            }
        }
    }
}