题目
判断一个 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
说明:
一个有效的数独(部分已被填充)不一定是可解的。
只需要根据以上规则,验证已经填入的数字是否有效即可。
给定数独序列只包含数字 1-9 和字符 '.' 。
给定数独永远是 9x9 形式的。
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/valid-sudoku
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。
拓展:
关于从数组下标到box序号的变换
重述一遍问题:给定i和j,如何判定board[i][j]在第几个box呢?
显然属于第几个box由i和j的组合唯一确定,例如board[2][2]一定是第0个box,board[4][7]一定是第5个box,可以画出来看一下,但是规律在哪里呢?
我们可以考虑一种简单的情况: 一个3x9的矩阵,被分成3个3x3的box,如图:
显然每个数属于哪个box就只取决于纵坐标,纵坐标为0/1/2的都属于box[0],纵坐标为3/4/5的都属于box[1],纵坐标为6/7/8的都属于box[2].也就是j/3.
而对于9x9的矩阵,我们光根据j/3得到0/1/2还是不够的,可能加上一个3的倍数,例如加0x3,表示本行的box,加1x3,表示在下一行的box,加2x3,表示在下两行的box, 这里的0/1/2怎么来的?和j/3差不多同理,也就是i/3。
参考:https://leetcode-cn.com/problems/valid-sudoku/solution/you-xiao-de-shu-du-by-leetcode/
/**
Problem:
判断一个 9x9 的数独是否有效。只需要根据以下规则,验证已经填入的数字是否有效即可。
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。
说明:
一个有效的数独(部分已被填充)不一定是可解的。
只需要根据以上规则,验证已经填入的数字是否有效即可。
给定数独序列只包含数字 1-9 和字符 '.' 。
给定数独永远是 9x9 形式的。
@author:Gallery
*/
/**
思路一:每一行不可能有重复,每一列不可能有重复,小数独内不可能有重复。
一次遍历 为每行、每列、每个33宫创建一个二位数组,第一维度数行(列/小数独的索引)
第二维度为判定某个数字在这行(列/小数独)是否出现。通过一次遍历来实现。
*/
#include <stdio.h>
#include <stdbool.h>
bool isValidSudoku(char** board, int boardSize, int* boardColSize)
{
int row[9][9] = {0};
int col[9][9] = {0};
int box[9][9] = {0};
int i,j,num;
//外层循环用于索引行/列/小数独
for(i = 0; i < boardSize;++i){
for(j = 0; j < boardSize;++j){
///行判断
if(board[i][j]!='.'){
///获取对应数字
num = board[i][j] -'1';
row[i][num]++; //行对应值加一
col[j][num]++; //列对应值加一
///精髓之处,自己一开始没想出来,参考别人资料,详解见拓展
box[(i/3)*3+(j/3)][num]++; //小数独对应值加一
///判定加一后是否还满足数独要求
if ((row[i][num] > 1) || (col[j][num] > 1) || (box[(i / 3) * 3 + (j / 3)][num] > 1)) {
return false;
}
}
}
}
return true;
}
int main(void)
{
//“ 改为 ‘ 测试时自行改正,楼主嫌弃麻烦。,不改了~~~~
char board[9][9] = {
{"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"}
};
int boardSize = 9;
bool result = isValidSudoku(board,boardSize,&boardSize);
if(result){
printf("OK");
}else
printf("NO");
return 0;
}