Leetcode 36 有效的数独

题目描述

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

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

注意：

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

来源：力扣（LeetCode）题目链接
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

示例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）或者 '.'

题解1（一次遍历）

class Solution {
public:
// 审题：根据规则来 验证 已经填入的数字是否有效
// 只需要找成立条件
// 唯一的注意是：小九宫格(i/3, j/3)不允许有重复数字
    bool isValidSudoku(vector<vector<char>>& board) {
        int rows[9][9];
        int columns[9][9];
        int subboxes[3][3][9];
        // 放弃for大法
        // 用memset将某一块内存中的内容全部设置为指定的值
        memset(rows,0,sizeof(rows));
        memset(columns,0,sizeof(columns));
        memset(subboxes,0,sizeof(subboxes));

        for(int i=0; i<9; i++){
            for(int j=0; j<9; j++){
                char c = board[i][j];
                // c不是.意味着有数字
                if(c != '.'){
                    int k = c - '0' -1;
                    rows[i][k] ++;
                    columns[j][k] ++;
                    subboxes[i/3][j/3][k] ++;
                    if(rows[i][k] > 1 || columns[j][k] > 1 || subboxes[i/3][j/3][k] > 1)
                        return false;
                }
            }
        }
        return true;

    }
};

题解2（位运算）

class Solution {
public:
    bool isValidSudoku(vector<vector<char>>& board) {
        vector<int>
        row = vector(9,0),
        column = vector(9,0),
        sub = vector(9, 0);

        for(int i=0; i < 9; i++){
            for(int j=0; j < 9; j++){
                if(board[i][j] != '.'){
                    // Keypoint : 1右移后 再相与 相当于用位数记录值（即 值 = 位数）
                    // 从0开始 || 能看到第x位是1（说明出现过x值）: eg. 13
                    // 0 & 1 || 1 = 1
                    // 1 & 1 << (3-1) = 1 & 100 = 100  (C++ 按位与 输出最后一位0) 
                    // 1 || 100 = 101  (意味着出现了1和3)
                    // 所以如果后面出现了重复的 &的结果 > 1
                    int c = 1 << (board[i][j] - '1');
                    if(row[i] & c)
                        return false;
                    else row[i] |= c;
                    if(column[j] & c)
                        return false;
                    else column[j] |= c;
                    // 用行列组合来标注sub block
                    if(sub[j/3*3+i/3] & c)
                        return false;
                    else sub[j/3*3+i/3] |= c;
                    
                }
            }
        } 
        return true;
    }
};