Leetcode刷题java之36. 有效的数独（一天一道编程题之四十一天）

最新推荐文章于 2025-08-14 09:11:10 发布

IDEA_TEYU_1112

最新推荐文章于 2025-08-14 09:11:10 发布

阅读量318

点赞数

CC 4.0 BY-SA版权

分类专栏： java面经之查缺补漏 Leecode 哈希文章标签： java

本文链接：https://blog.csdn.net/qq_41901915/article/details/105230889

Leecode 同时被 3 个专栏收录

205 篇文章

订阅专栏

java面经之查缺补漏

108 篇文章

订阅专栏

哈希

10 篇文章

订阅专栏

本文介绍了一种高效验证数独是否有效的算法，通过一次性遍历并使用哈希表记录行、列和宫内的数字出现情况，确保每个数字在相应区域仅出现一次。此算法在Java实现中表现出色，执行速度快，内存消耗低。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

执行结果：

通过

显示详情

执行用时 :2 ms, 在所有 Java 提交中击败了95.75% 的用户

内存消耗 :40 MB, 在所有 Java 提交中击败了98.25%的用户

题目：

判断一个 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 形式的。

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/valid-sudoku
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

思路：

遍历一次，但是在开始的时候就建立好行，列，box的哈希表

关键在于box 的索引i/3*3+j/3

代码：

class Solution {
    public boolean isValidSudoku(char[][] board) {
        int[][] rows=new int[9][9];
        int[][] cols=new int[9][9];
        int[][] boxs=new int[9][9];
        for(int i=0;i<9;i++)
        {
            for(int j=0;j<9;j++)
            {
                if(board[i][j]=='.')
                {
                    continue;
                }
                int num=board[i][j]-'1';
                //关键在于这个box索引
                int box_index=i/3*3+j/3;
                rows[i][num]++;
                cols[j][num]++;
                boxs[box_index][num]++;
                if(rows[i][num]>1||cols[j][num]>1||boxs[box_index][num]>1)
                {
                    return false;
                }
            }
        }
        return true;
    }
}