36. 有效的数独

最新推荐文章于 2024-01-12 11:36:13 发布

Duck_Duck_

最新推荐文章于 2024-01-12 11:36:13 发布

阅读量112

点赞数

分类专栏： Leetcode Java 文章标签： leetcode

本文链接：https://blog.csdn.net/Duck_Duck_/article/details/108593186

版权

Leetcode 同时被 2 个专栏收录

218 篇文章 0 订阅

订阅专栏

Java

215 篇文章 0 订阅

订阅专栏

难度：中等

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

分析：

按三个条件来分别判断，但是可以只一趟遍历。

找规律可知，box的index = （i /3）*3 + j /3 表示

代码：

class Solution {
    public boolean isValidSudoku(char[][] board) {
        int row[][] = new int[9][9];
        int col[][] = new int[9][9];
        int box[][] = new int[9][9];
        for (int i = 0; i < board.length; i++) {
            for (int j = 0; j < board[0].length; j++) {
                if(board[i][j] != '.'){
                    int num = board[i][j]-'1';
                    int box_index = (i/3)*3 + j/3;
                    if (row[i][num]==1) return false;
                    else row[i][num] = 1;
                    if(col[j][num]==1) return false;
                    else col[j][num] = 1;
                    if(box[box_index][num]==1) return false;
                    else box[box_index][num] = 1;
                }
            }
        }
        return true;
    }
}

结果：