【Leetcode】36. 有效的数独

题目描述

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

1. 数字 1-9 在每一行只能出现一次。
2. 数字 1-9 在每一列只能出现一次。
3. 数字 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. 一个有效的数独（部分已被填充）不一定是可解的。
2. 只需要根据以上规则，验证已经填入的数字是否有效即可。
3. 给定数独序列只包含数字 1-9 和字符 ‘.’ 。
4. 给定数独永远是 9x9 形式的。

算法描述

因为数组的大小是确定的9x9，因此直接遍历整个数组不会有超时的风险。
声明三个二维数组line[ 9 ][ 10 ], col[9][10], box[9][10], 记录每一行1-9出现的次数、每一列1-9出现的次数和每个3x3小格中出现的次数。
其中box的编号计算公式为

box_index = (line_index/3)*3 + col_index/3

C++代码

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        int line[9][10], col[9][10], box[9][10];
        for(int i=0;i<9;i++){
            for(int j=1;j<=9;j++){
                line[i][j]=0;
                col[i][j]=0;
                box[i][j]=0;
            }
        }
        for(int i=0;i<9;i++){
            for(int j=0;j<9;j++){
                if(board[i][j] == '.'){
                    continue;
                }
                int num = board[i][j]-'0';
                int box_index = (i/3)*3 + j/3;
                if(line[i][num] == 0){
                    line[i][num]++;
                }
                else{
                    return false;
                }
                if(col[j][num] == 0){
                    col[j][num]++;
                }
                else return false;
                if(box[box_index][num] == 0){
                    box[box_index][num]++;
                }
                else return false;
            }
        }
        return true;
    }
};