36. 有效的数独

判断一个 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 形式的。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/valid-sudoku
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

解法：通过缓存，遍历一遍二维数组，可以通过3个二维数组来分别表示行列box，进一步可以把他们压缩成一个一维数组，这样子的就可以把一个32位的整形数按照9位9为划分来分别表示行列box。box的计算是，i的话每超过3就增加3，j的话每超过3就增加1，因此为(i/3)*3 + (j/3)

class Solution {
public:
    bool isValidSudoku1(vector<vector<char>>& board) {
        if(board.size() == 0)
            return true;
        //分别表示行列及box，横坐标为数，纵坐标为行列或哪个box
        vector<vector<int>> columns(9,vector<int>(9,0));
        vector<vector<int>> rows(9,vector<int>(9,0));
        vector<vector<int>> boxs(9,vector<int>(9,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] - '1';
                int box_index = (i/3)*3+j/3;
                if(columns[num][i] != 0 || rows[num][j] != 0 || boxs[num][box_index] != 0)
                    return false;
                columns[num][i] =  1;
                rows[num][j] = 1;
                boxs[num][box_index] = 1;
            }
        }
        return true;
    }
    bool isValidSudoku(vector<vector<char>>& board) {
        if(board.size() == 0)
            return true;
        //只用一个数组，数组中的每个数是一个int型，有32位，可以
        //9位9位划分，分别表示行列box，仍然用横坐标表示数
        vector<int> mark(9,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] - '1';
               int box_index = (i / 3) * 3 + j / 3;
               int column = 0x01 << num;
               int row = 0x01 << 9 << num;
               int box  = 0x01 << 9 << 9 << num;
               if( (mark[i] & column) == column ||
                   (mark[j] & row) == row ||
                   (mark[box_index] & box) == box)
                    return false;
                mark[i] = mark[i] | column;
                mark[j] = mark[j] | row;
                mark[box_index] = mark[box_index] | box;
            }
        }
        return true;
    }
};