有效的数独

有效的数独

题目描述

请你判断一个 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 存在, 因此这个数独是无效的。

题目来源

力扣 (LeetCode)

题目解析

1. 利用二维数组，记录每一行，每一列，每一个九宫格元素出现的次数
2. 对于九宫格index的确定，观察可以发现，index = i / 3 *3 + j / 3

public boolean isValidSudoku(char[][] board) {
    int[][] line = new int[9][9];
    int[][] row = new int[9][9];
    int[][] block = new int[9][9];
    for (int i = 0; i < 9; i++) {
        for (int j = 0; j < 9; j++) {
            if (board[i][j] != '.'){
                int num = board[i][j] - '0' - 1;
                int k = i / 3 * 3 + j / 3;
                if (line[i][num] != 0 || row[j][num] != 0 || block[k][num] != 0) {
                    return false;
                }
                line[i][num] = row[j][num] = block[k][num] = 1;
            }
        }
    }
    return true;
}