题目:
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.
思路:
只要判断每一行每一列以及每个九宫格不出现相同的数字即可。
代码:
class Solution {
public:
bool isValidSudoku(vector<vector<char> > &board)
{
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++)
{
//判断每一行是否有重复,如果当前字符为'.',则不处理
//如果不为点,若判断对应的数字出现的次数是否>0,大于0代表有重复,则返回假(第二次出现时判断之前出现的次数>0,即说明此次重复)
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;
}
};