【LeetCode】有效的数独 [M]（模拟）

36. 有效的数独 - 力扣（LeetCode）

一、题目

请你判断一个 9 x 9 的数独是否有效。只需要 根据以下规则 ，验证已经填入的数字是否有效即可。

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"]]
输出：true 

示例 2：
输入：board = 
[["8","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"]]
输出：false

提示：

• board.length == 9
• board[i].length == 9
• board[i][j] 是一位数字（1-9）或者 '.'

二、代码

class Solution {
    public boolean isValidSudoku(char[][] board) {
        // row[x][y]：y这个数在第x行是否出现过
        boolean[][] row = new boolean[9][10];
        // col[x][y]：y这个数在第x列是否出现过
        boolean[][] col = new boolean[9][10];
        // bucket[x][y]：y这个数在第x号宫格内是否出现过
        boolean[][] bucket = new boolean[9][10];

        // 开始遍历整个矩阵
        for (int i = 0; i < board.length; i++) {
            for (int j = 0; j < board[0].length; j++) {
                // 当前遍历到的位置填写了数字
                if (board[i][j] != '.') {
                    // 取得该位置的数字
                    int num = board[i][j] - '0';
                    // 计算当前数字所在的3*3宫格的编号
                    int bid = (i / 3) * 3 + (j / 3); 
                    // 只要是列、行、宫格内曾经出现过这个数，直接返回false
                    if (row[i][num] || col[j][num] || bucket[bid][num]) {
                        return false;
                    }

                    // 记录上num这个数已经出现过了
                    row[i][num] = true;
                    col[j][num] = true;
                    bucket[bid][num] = true;
                }
            }
        }

        // 如果执行完了循环，则说明整个矩阵符合要求，返回true
        return true;
    }
}

三、解题思路 

准备3个二维数组，用来记录：

• 每一行1~9有没有出现
• 每一列1~9有没有出现
• 每一个以粗实线分隔的 3x3 宫内1~9有没有出现

整个过程就是模拟的过程，直接暴力遍历检查该数是否存在过即可。