Leetcode 36：Valid Sudoku

Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:

Each row must contain the digits 1-9 without repetition.
Each column must contain the digits 1-9 without repetition.
Each of the 9 3x3 sub-boxes of the grid must contain the digits 1-9 without repetition.

A partially filled sudoku which is valid.

The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’.

Example 1:

Input:
[
[“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”]
]
Output: true
Example 2:

Input:
[
[“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”]
]
Output: false
Explanation: Same as Example 1, except with the 5 in the top left corner being
modified to 8. Since there are two 8’s in the top left 3x3 sub-box, it is invalid.

C++
bool isValidSudoku(vector<vector<char>>& board) {
        if(board.empty()||board[0].empty())
            return false;
        int height = board.size();
        int width = board[0].size();
        vector<vector<bool>> cols(height,vector<bool>(width,0));
        vector<vector<bool>> rows(width,vector<bool>(height,0));
        vector<vector<bool>> cube(9,vector<bool>(9,0));
        for(int i = 0;i < height;++i)
        {
            for(int j = 0;j < width;++j)
            {
                if(board[i][j] >= '1'&&board[i][j] <= '9')
                {
                    int c = board[i][j] - '1';
                    int cubecol = (i/3)*3 + (j/3);
                    if(cols[i][c]||rows[j][c]||cube[cubecol][c])
                        return false;
                    else
                    {
                        cols[i][c] = true;
                        rows[j][c] = true;
                        cube[cubecol][c] = true;
                    }
                }
            }
        }
        return true;
    }