Leetcode：IsValidSudoku有效的数独

题目：

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

数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。（请参考示例图）
注意：

一个有效的数独（部分已被填充）不一定是可解的。
只需要根据以上规则，验证已经填入的数字是否有效即可。
空白格用 '.' 表示。

输入：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

思路：

用哈希表！创建一个Vector类的map 存放row(9) col(9) sub(9) 

代码：

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        vector<map<int,int>> row(9),col(9),sub(9);
        for(int i = 0; i < 9; i++){
            for(int j = 0; j < 9; j++){
                if(board[i][j] == '.'){
                    continue;
                }

                if(row[i].find(board[i][j]) != row[i].end()){  //判断每一行是否有重复
                    return false;
                }
                if(col[j].find(board[i][j]) != col[j].end()){  //判断每一列是否有重复
                    return false;
                }
                if(sub[(i/3)*3 + j/3].find(board[i][j]) != sub[(i/3)*3 + j/3].end()){
                    return false;                        //判断每一组是否有重复
                }

                row[i][board[i][j]] = 1;  //把board里的数存进去  作为row的key值
                col[j][board[i][j]] = 1;  //把board里的数存进去  作为col的key值
                sub[(i/3)*3 + j/3][board[i][j]] = 1;  //把每个9个组成的方块分组
            }
        }
        return true;
    }
};