Leetcode--有效的数独

有效的数独

题目：https://leetcode-cn.com/problems/valid-sudoku/

判断一个 9x9 的数独是否有效。
只需要根据以下规则，验证已经填入的数字是否有效即可。
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。

上图是一个部分填充的有效的数独。

数独部分空格内已填入了数字，空白格用 '.' 表示。

示例 1:

输入:
[
 ["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:

输入:
[
 ["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 存在, 因此这个数独是无效的。
说明:
一个有效的数独（部分已被填充）不一定是可解的。
只需要根据以上规则，验证已经填入的数字是否有效即可。
给定数独序列只包含数字 1-9 和字符 '.' 。
给定数独永远是 9x9 形式的。

数独：题目要求的是
1.1–9数字不能出现多次(只能0或1)
2.只是判断部分数独
3.满足范围：rows , colunms, box(小九方格)
哈希表:

unordered_map <int,int> rowshash[9];
unordered_map <int,int> colunms[9];
unordered_map <int,int> min_box[9];

对于min_box的区块分配：

//依题意分为9部分
box_index =  i / 3 * 3 + j / 3;

例如：[row][column]
[0~2][0~2]-->box_index = 0;
[0~2][3~5]-->box_index = 1;
[3~5][0~2]-->box_index = 4;

对于该输入进行储存，判断

 for (int i = 0; i < 9; ++i)
        {
            for (int j = 0; j < 9; ++j)
            {
                if (board[i][j] != '.')
                {
                    int temp = (int)board[i][j];
                    int box_index = i / 3 * 3 + j / 3;
                    //
                    ++rowhash[i][temp];
                    ++colunms[j][temp];
                    ++in_boxs[box_index][temp];
                    //judge 重复就return
                    if (rowhash[i][temp] > 1 || colunms[j][temp] > 1 || in_boxs[box_index][temp] > 1)
                        return false;
                }
            }
        }

合体：

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        //underworld
        unordered_map <int, int> rowhash[9];
        unordered_map <int, int> colunms[9];
        unordered_map <int, int> in_boxs[9];
        //initial
        for (int i = 0; i < 9; ++i)
        {
            for (int j = 0; j < 9; ++j)
            {
                if (board[i][j] != '.')
                {
                    int temp = (int)board[i][j];
                    int box_index = i / 3 * 3 + j / 3;
                    ++rowhash[i][temp];
                    ++colunms[j][temp];
                    ++in_boxs[box_index][temp];
                    if (rowhash[i][temp] > 1 || colunms[j][temp] > 1 || in_boxs[box_index][temp] > 1)
                        return false;
                }
            }
        }
        return true;
    }
};