(leetcode学习)36. 有效的数独

请你判断一个 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）或者 '.'

纯暴力写的。

感觉不用哈希表，用0~9的数组代替会快不少，不想改了

三个判断换顺序，面向测试用例编程应该也能提高速度

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        vector<vector<int>> start = {{0, 0}, {0, 3}, {0, 6},
                                    {3, 0}, {3, 3}, {3, 6},
                                    {6, 0}, {6, 3}, {6, 6}};

        for(int i=0; i<start.size(); i++){
            int row = start[i][0], col = start[i][1];
            unordered_set<char> mys;
            for(int j=0; j<3; j++){
                for(int k=0; k<3; k++){
                    char c = board[row + j][col + k];
                    if(c == '.' ) continue;
                    else{
                        if(mys.find(c) == mys.end()) mys.insert(c);
                        else return false;
                    }
                }
            }
        }

        for(int i=0; i<9; i++){
            unordered_set<int> mys;
            for(int j=0; j<9; j++){
                char c = board[i][j];
                if(c == '.' ) continue;
                else{
                    if(mys.find(c) == mys.end()) mys.insert(c);
                    else return false;
                }
            }
        }

        for(int i=0; i<9; i++){
            unordered_set<int> mys;
            for(int j=0; j<9; j++){
                char c = board[j][i];
                if(c == '.' ) continue;
                else{
                    if(mys.find(c) == mys.end()) mys.insert(c);
                    else return false;
                }
            }
        }
        return true;
    }
};