如何设计小巧好用的算法 力扣36题:有效的数独

算法设计上, 往往一个精巧的式子就能解决很多问题, 问题的关键是如何设计算法,就要根据数学上的依赖关系算出等式或者不等式,通过这些式子从而设计出算法。常用的算数符号有同余， 除法等。

力扣第36题：
36. 有效的数独
请你判断一个 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] 是一位数字或者 ‘.’

算法式子（重点）：每一块方格编号k和横（i）纵（j）坐标之间的关系是k = (i/3)*3+j/3;从而更快更简便地得到算法如下:

bool isValidSudoku(vector<vector<char>>& board){
    
    int map0[10];
    int map1[9][10], k;
    memset(map1, 0, sizeof(map1));
    for(int i = 0; i < 9; i++){
        //每一行是否合格
        memset(map0, 0, sizeof(map0));
        for(int j = 0; j < 9; j++){
            if(board[i][j] != '.'){
                if(map0[board[i][j] - '0'] == 0){
                    map0[board[i][j]-'0']++;
                }else{
                    return false;
                }
            }
        }
        
        //每一列是否合格
        memset(map0, 0, sizeof(map0));
        for(int j = 0; j < 9; j++){
            if(board[j][i] != '.'){
                if(map0[board[j][i]-'0'] == 0){
                    map0[board[j][i]-'0']++;
                }else{
                    return false;
                }
            }
            k = (i/3)*3+j/3;
            if(board[i][j] != '.'){
                if(map1[k][board[i][j] - '0'] == 0){
                    map1[k][board[i][j] - '0']++;
                }else{
                    return false;
                }
            }
        }
        
    }
    return true;
}