高频leetcode哈希表部分：36. 有效的数独

36. 有效的数独

难度中等749
请你判断一个 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 {
public:
    const int L=9;
    bool isValidSudoku(vector<vector<char>>& board) {
        unordered_map<char,int> hash;
        int i,j,k;
        for(i=0;i<L;i++)//行查重
        {
            hash.clear();
            for(j=0;j<L;j++)
                if(board[i][j]!='.' && hash[board[i][j]]++)
                    return false;
        }
        for(i=0;i<L;i++)//列查重
        {
            hash.clear();
            for(j=0;j<L;j++)
                if(board[j][i]!='.' && hash[board[j][i]]++)
                    return false;
        }
        for(i=0;i<L;i++)//九宫格查重
        {
            hash.clear();
            for(j=(i/3)*3;j<=(i/3)*3+2;j++)   
                for(k=(i%3)*3;k<=(i%3)*3+2;k++)
	                if(board[j][k]!='.' && hash[board[j][k]]++)
	                    return false;
        }
        return true;
    }
};