Description:
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.
Solution:
一开始没理解题意,以为它给出一个大九宫格,自己要判断能不能被填完而且是合法的...(这应该是工作量巨大的,因此只写了想法...)
// 0.检查已存在的字符在行、列、块上是否有重复的数字,有则invalid,否则进入1
// 1.为每一个空位置建立三个数组(行,列,块),用于存储可能的数字
// 2.分别进行行、列、块搜索,为每个空位置的对应三个数组输入剩余可以填入的数字
// 3.对每个空位置的三个数组取交集,若交集为空,则invalid,否则进入4
// 4.对行、列、块进行更新:空位置三数组的交集若只有1个,则填入,循环直到无法更新,若填满则valid,否则进入3
后来看到Note:Only the filled cells need to be validated. 也就是说只需要检查它传入的已经被填好的空格即可,代码思路比较简单,就是将上面我的思路截去更新一段就可以了。
这里值得注意的是坐标的表示,单独将每个空格的行号、列号拿出来逐个比较更容易看出规律:
class Solution {
public:
bool isValidSudoku(vector<vector<char>>& board) {
for (int i = 0; i < 9; i++) {
bool rowCheck[10] = {false};
bool colCheck[10] = {false};
bool blockCheck[10] = {false};
for (int j = 0; j < 9; j++) {
if (board[i][j] != '.') {
if (rowCheck[board[i][j] - '0'])
return false;
rowCheck[board[i][j] - '0'] = true;
}
if (board[j][i] != '.') {
if (colCheck[board[j][i] - '0'])
return false;
colCheck[board[j][i] - '0'] = true;
}
if (board[(i / 3) * 3 + j / 3][j % 3 + (i % 3) * 3] != '.') {
if (blockCheck[board[(i / 3) * 3 + j / 3][j % 3 + (i % 3) * 3] - '0'])
return false;
blockCheck[board[(i / 3) * 3 + j / 3][j % 3 + (i % 3) * 3] - '0'] = true;
}
}
}
return true;
}
};