审题
判断一个 9x9 的数独是否有效。只需要根据以下规则,验证已经填入的数字是否有效即可。
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。
上图是一个部分填充的有效的数独。
数独部分空格内已填入了数字,空白格用 '.' 表示。
示例 1:
输入:
[
["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"]
]
输出: true
示例 2:
输入:
[
["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"]
]
输出: false
解释: 除了第一行的第一个数字从 5 改为 8 以外,空格内其他数字均与 示例1 相同。
但由于位于左上角的 3x3 宫内有两个 8 存在, 因此这个数独是无效的。
说明:
一个有效的数独(部分已被填充)不一定是可解的。
只需要根据以上规则,验证已经填入的数字是否有效即可。
给定数独序列只包含数字 1-9 和字符 '.' 。
给定数独永远是 9x9 形式的。
这道题的话,一看就感觉到应该是个中级模拟,难度不大,码量稍微大一点,我们直接就四个模块走起,三个函数分别判断行,列,九宫格符不符合要求,一个辅助函数判断每一行/列/九宫格符不符合要求。直接上代码。
代码实现
方案一(上文提到的的方法):
三个模块分别判断,全OK,才是一个合理的数独,代码比较简单。
class Solution {
public:
bool check_dup(const int arr[]) {
for ( int i=1; i<10; i++ ) {
if ( arr[i] > 1 ) return true;
}
return false;
}
void set_Null(int (&arr)[10]) {
memset(arr,0,sizeof(arr));
}
bool check_row(vector<vector<char>>& board) {
int arr[10];
for ( int i=0; i<9; i++ ) {
set_Null(arr);
for ( int j=0; j<9; j++ ) {
if ( board[i][j] == '.' ) continue;
arr[board[i][j]-'0']++;
}
if ( check_dup(arr) ) return false;
}
return true;
}
bool check_col(vector<vector<char>>& board) {
int arr[10];
for ( int i=0; i<9; i++ ) {
set_Null(arr);
for ( int j=0; j<9; j++ ) {
if ( board[j][i] == '.' ) continue;
arr[board[j][i]-'0']++;
}
if ( check_dup(arr) ) return false;
}
return true;
}
bool check_nine(vector<vector<char>>& board) {
int arr[10];
int flag_i=0;
int flag_j=0;
while ( flag_i != 3 ) {
set_Null(arr);
for ( int i=flag_i*3; i<flag_i*3+3; i++ ) {
for ( int j=flag_j*3; j<flag_j*3+3; j++ ) {
if ( board[i][j] == '.' ) continue;
arr[board[i][j]-'0']++;
}
}
if ( check_dup(arr) ) return false;
flag_j++;
if ( flag_j == 3 ) {
flag_j=0;
flag_i++;
}
}
return true;
}
bool isValidSudoku(vector<vector<char>>& board) {
if ( check_col(board) && check_row(board) && check_nine(board) ) return true;
else return false;
}
};
方案2:
哈希表操作,因为官方题解并没有C++的操作,而且九个数字也不太会用到哈希表…这个方法先放了,过两天看看别的哈希操作再补。
反思
中级模拟,没啥好说的,代码还可以优化。