36. 有效的数独
-
题目
请你判断一个 9x9 的数独是否有效。只需要 根据以下规则 ,验证已经填入的数字是否有效即可。
数字 1-9 在每一行只能出现一次。
数字 1-9 在每一列只能出现一次。
数字 1-9 在每一个以粗实线分隔的 3x3 宫内只能出现一次。(请参考示例图)
数独部分空格内已填入了数字,空白格用 ‘.’ 表示。注意:
一个有效的数独(部分已被填充)不一定是可解的。
只需要根据以上规则,验证已经填入的数字是否有效即可。
示例 1:
输入:board =
[[“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:
输入:board =
[[“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 存在, 因此这个数独是无效的。
-
难度:中等
-
分类:多看
-
题解
这道题是非常典型的操作数组的题目。对于行、列和3*3的矩阵,我们都分别对他们分配数组空间。在eclipse当中,数组的初值是0。对于对于统计每行、每列的字符出现的次数,这里就不再累述,这里我们详细讲讲对于3 * 3矩阵我们的操作。
首先矩阵是三位的,第一维度是第几个矩阵,第二维度是行,第三维度是列。首先我们判断是第几个矩阵用到了公式:
i n d e x 1 = ( h a n g / 3 ) ∗ 3 + ( l i e / 3 ) index_1=(hang/3)*3+(lie/3) index1=(hang/3)∗3+(lie/3)
这里我们知道在编程中这个“/”符号他是向下取余的作用。对于第二维度,首先我们需要获得,当前遍历的这个数组的值是多少,有如下公式:
i n d e x = b o a r d [ i ] [ j ] − ′ 0 ′ − 1 index=board[i][j]-'0'-1 index=board[i][j]−′0′−1
然后我们计算它所对应的行列就有:
i n d e x 2 = i n d e x / 3 i n d e x 3 = i n d e x index_2=index/3 \\ index_3=index%3 index2=index/3index3=index -
代码如下:
public boolean isValidSudoku(char[][] board) { int [][]row =new int [9][9]; int [][]col=new int [9][9]; int [][][]tmt=new int [9][3][3]; for(int i=0;i<board.length;i++) { for(int j=0;j<board[0].length;j++) { int index=board[i][j]-'0'-1; if(index>-1) { if(row[i][index]==0) { row[i][index]=1; } else { return false; } if(col[j][index]==0) { col[j][index]=1; } else { return false; } if(tmt[(i/3)*3+(j/3)][index/3][index%3]==0) { tmt[(i/3)*3+(j/3)][index/3][index%3]=1; } else { return false; } } } } return true; }
那么按照以上方式提交的结果则是:
来源:力扣(LeetCode)
链接:https://leetcode-cn.com/problems/valid-sudoku
著作权归领扣网络所有。商业转载请联系官方授权,非商业转载请注明出处。