Leetcode 36. 有效的数独

最新推荐文章于 2024-07-22 22:58:19 发布

baymax！！

最新推荐文章于 2024-07-22 22:58:19 发布

阅读量237

点赞数

分类专栏： java学习文章标签： java

本文链接：https://blog.csdn.net/weixin_49865619/article/details/128509469

版权

java学习专栏收录该内容

14 篇文章 0 订阅

订阅专栏

请你判断一个 9 x 9 的数独是否有效。只需要 根据以下规则 ，验证已经填入的数字是否有效即可。

数字 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 存在, 因此这个数独是无效的。

提示：

board.length == 9
board[i].length == 9
board[i][j] 是一位数字（1-9）或者 '.'

思考：

用数组记录每个数字出现的次数

数字是从1—9，所以范围要设为10，或者设为9，但是 int temptonum=temp-'0'-1，要再减一
if(arr1[i][temptonum]>1||arr2[j][temptonum]>1||arr3[i/3][j/3][temptonum]>1)

{

return false;

}

这一段要放在if(temp!='.')里面，不然会报错！！！！！！

class Solution {
    public boolean isValidSudoku(char[][] board) {
        int[][] arr1=new int[9][10];//每行每个数字出现的次数
        int[][] arr2=new int[9][10];//每列每个数字出现的次数
        int[][][] arr3=new int [3][3][10];//每一个小九宫格的每一格数字出现的次数
        //通过int[i/3][j/3][index+1]，得到第i行第j列数字所处在的九宫格中index+1数字出现的次数

        for(int i=0;i<9;i++){
            for(int j=0;j<9;j++){
                char temp=board[i][j];
                if(temp!='.'){
                    int temptonum=temp-'0';//得到int类型的字符,5
                    arr1[i][temptonum]++;
                    arr2[j][temptonum]++;
                    arr3[i/3][j/3][temptonum]++;
                    if(arr1[i][temptonum]>1||arr2[j][temptonum]>1||arr3[i/3][j/3][temptonum]>1)
                    {
                       return false;
                    }
                }
            }
        }
        return true;

    }
}