Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.
The Sudoku board could be partially filled, where empty cells are filled with the character '.'
.
A partially filled sudoku which is valid.
Note:
A valid Sudoku board (partially filled) is not necessarily solvable. Only the filled cells need to be validated.
题目解析:
数独:每一行不能重复,数值为1-9;每一列不能重复,数值1-9;九个小方格不能重复,数值1-9。
这道题只是让判断是否满足这个条件,那么就简历hash数组。判断是否存在:row[board[i][j]-'1'] > 0 。比如board[i][j]='5'。那么表示这个5在数组中是否出现过,出现过就返回错误。
bool isValidSudoku(vector<vector<char> > &board) {
// Note: The Solution object is instantiated only once.
int row[9],col[9];
for(int i = 0; i < 9; i++)
{
memset(row,0,sizeof(int)*9);
memset(col,0,sizeof(int)*9);
for(int j = 0; j < 9; j++)
{
if(board[i][j] != '.')
{
if(row[board[i][j]-'1'] > 0)return false;
else row[board[i][j]-'1']++;
}
if(board[j][i] != '.')
{
if(col[board[j][i]-'1'] > 0)return false;
else col[board[j][i]-'1']++;
}
}
}
for(int i = 0; i < 9; i+=3)
for(int j = 0; j < 9; j+=3)
{
memset(row,0,sizeof(int)*9);
for(int a = 0; a < 3; a++)
for(int b= 0; b < 3; b++)
if(board[i+a][j+b] != '.')
{
if(row[board[i+a][j+b]-'1']>0)return false;
else row[board[i+a][j+b]-'1']++;
}
}
return true;
}
更精简的代码是,利用行列的关系来表示宫格。代码精简了,但是浪费了空间。
bool isValidSudoku(vector<vector<char> > &board) {
// Note: The Solution object is instantiated only once.
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;
}