LeetCode 36 有效的数独 C++

题目

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

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 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] 是一位数字或者 '.'

解法

该题的思路比较简单，遍历整个数组，分别对行、列、宫内是否满足数独的要求。

问题的关键是在于如何对宫的索引进行表示，先看表达式box_index = (row / 3) * 3 + columns / 3

9*9的数独中我们以每一个数字为最小单元，而为了表示宫的索引，我们以3*3的矩阵为最小单元，

那么一个9*9的数独矩阵将由9个3*3的宫矩阵组成，宫的索引为0-8，亦可以表示为[0,0]-[2-2]

• 对行、列除以3：表达行列的最小单元为一个数独矩阵中的一个数，而表达宫的最小单元为3*3矩阵，最小单元发生变化，所以需要除3
• 行数除以3后还要乘上3：通过0-8与[0,0]-[2-2]两种表达宫的索引的形式对比，即可看出原因，当行数进位时，[0,1]->[1,1]，相当于1->4，即行数的进位，会使宫的索引的位置前进三，而列进位1，只会使宫的索引的位置前进一，故box_index表达式中行数除以三后还需乘三

 bool isValidSudoku(vector<vector<char>>& board) {
        vector<unordered_map<int,int>> row(9), col(9), block(9);
        for(int i = 0; i < 9; ++ i){
            for(int j = 0; j < 9; ++ j){
                int bindex =  (i / 3)* 3 + j / 3;
                char cur = board[i][j];
                if(cur == '.')  continue;
                if(row[i].count(cur) || col[j].count(cur) || block[bindex].count(cur))  return false;
                row[i][cur] = 1;
                col[j][cur] = 1;
                block[bindex][cur] = 1;
            }
        }
        return true;
    }

官方题解链接

https://leetcode-cn.com/problems/valid-sudoku/solution/you-xiao-de-shu-du-by-leetcode/