力扣36. 有效的数独（数组、矩阵、C++）

请你判断一个 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
解释：除了第一行的第一个数字从 5 改为 8 以外，空格内其他数字均与 示例1 相同。 但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。

提示：

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

 

class Solution { // 定义一个名为 Solution 的类
public: // 公开接口
    bool isValidSudoku(vector<vector<char>>& board) { // 定义一个公共方法 isValidSudoku，它接受一个字符向量的二维数组作为参数
        // 初始化三个二维数组 row、columns 和 subboxes，用于跟踪每行、每列和每个子方格内数字 1-9 的出现次数
        int row[9][9], columns[9][9], subboxes[3][3][9];
        // 清零这三个数组，确保它们的所有元素都是 0
        memset(row, 0, sizeof(row));
        memset(columns, 0, sizeof(columns));
        memset(subboxes, 0, sizeof(subboxes));
        
        // 遍历整个棋盘的行
        for (int i = 0; i < 9; i++) {
            // 遍历整个棋盘的列
            for (int j = 0; j < 9; j++) {
                // 如果当前单元格不是点号 '.'，说明已经填充了一个数字
                if (board[i][j] != '.') {
                    // 获取当前单元格的数字，并转换为整数
                    int c = board[i][j];
                    // 计算数字在 row、columns 和 subboxes 数组中的索引
                    int idex = c - '0' - 1;
                    // 增加当前数字在行、列和子方格的计数器
                    row[i][idex]++;
                    columns[j][idex]++;
                    subboxes[i / 3][j / 3][idex]++;
                    
                    // 检查当前数字是否在行、列或子方格中出现了多次
                    if (row[i][idex] > 1 || columns[j][idex] > 1 ||
                        subboxes[i / 3][j / 3][idex] > 1)
                        // 如果出现多次，则说明数独规则被违反，返回 false
                        return false;
                }
            }
        }
        // 如果所有单元格都被检查过，并且数独规则没有被违反，返回 true
        return true;
    }
};

首先创造两个二维数组和一个三维数组，分别用来存储每行、每列、每宫里面各个数所出现的次数，用memset将它们初始化都是0，用for循环嵌套遍历整个棋盘的每行每列，当当前的数不是‘.’时，既该位置有数字，不是空格，那么增加当前数字的所在行，所在列，所在方格的次数。这时检查一下该位置是否有大于1，如果大于1了，则不满足数独要求，返回false。在所有数字都遍历完之后还没有返回false，就证明满足数独，返回true。