LeetCode-NOTES/Algorithms/36.Valid-Sudoku/solution.cpp at master · mkn-root12/LeetCode-NOTES · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution
{
public:
    bool isValidSudoku(vector<vector<char> > &board)
    {
        vector<vector<bool> > rows(9, vector<bool>(9,false));
        vector<vector<bool> > cols(9, vector<bool>(9,false));
        vector<vector<bool> > blocks(9, vector<bool>(9,false));

        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';
                if(rows[i][num] || cols[j][num] || blocks[i - i%3 + j/3][num])
                    return false;
                rows[i][num] = cols[j][num] = blocks[i - i%3 + j/3][num] = true;
            }
        return true;
    }
};