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 digits1-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.
Note:
- A Sudoku board (partially filled) could be valid but is not necessarily solvable.
- Only the filled cells need to be validated according to the mentioned rules.
- The given board contain only digits
1-9
and the character'.'
. - The given board size is always
9x9
.
思路:三个哈希表,分别存储行、列、方块中出现1-9的状态
class Solution {
public:
bool isValidSudoku(vector<vector<char>>& board) {
int row_num = board.size();
int col_num = board[0].size();
char row_hash[9][9] = {0};
char col_hash[9][9] = {0};
char square_hash[9][9] = {0};
for(int i=0; i<row_num; i++)
{
for(int j=0; j<col_num; j++)
{
char c = board[i][j];
if(c == '.')
{
continue;
}
int k = c-'1';
if(row_hash[i][k] || col_hash[j][k] || square_hash[i/3*3+j/3][k] )
{
return false;
}
row_hash[i][k] = 1;
col_hash[j][k] = 1;
square_hash[i/3*3+j/3][k] = 1;
}
}
return true;
}
};