leetcode-36. 有效的数独

题目

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

解题思路

从限制条件来看，主要验证3个方面。

1. 验证一行中是否没有重复数字
2. 验证一列中是否没有重复数字
3. 验证一个小方格（3*3）中是否没有重复数字

行的比较简单，保存每行的数字即可。列的话，用一下二维矩阵转置的技巧，也比较好些。小方格的话，每次起始的位置是固定的，依次保存在一个列表中即可。

最后看看是否上面3个条件都满足。

代码

class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        row_nums = [[item for item in each_row if item != '.'] for each_row in board]
        col_nums = [[item for item in each_col if item != '.'] for each_col in zip(*board)]
        small_square_nums = [[board[row + i][col + j] for i in range(3) for j in range(3) if board[row + i][col + j] != '.']for row in (0, 3, 6) for col in (0, 3, 6)]
        return all(len(set(x)) == len(x) for x in (*row_nums, *col_nums, *small_square_nums))