36.有效的数独

请你判断一个 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）
链接：https://leetcode-cn.com/problems/valid-sudoku/
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

# 将横、竖、斜所对应数字添加至列表，遍历列表并判断去重前和去重后的长度是否相等，若相等则表示无重复字符
class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:        
        row = [[i for i in j if i != "."] for j in board]  # 存放横行的数字
        col = [[i for i in j if i != "."] for j in zip(*board)]  # 存放竖列的数字
        pal = []  # 存放3*3宫的数字

        for i in range(0, 9, 3):
            for j in range(0, 9, 3):
                mid = []  # 初始化空列表存储3*3宫内的数字
                for x in range(3):
                    for y in range(3):
                        if board[i + x][j + y] != ".":
                           mid.append(board[i + x][j + y])
                pal.append(mid)
                mid = []


        for i in range(9):
            if len(row[i]) != len(set(row[i])) or len(col[i]) != len(set(col[i])) or len(pal[i]) != len(set(pal[i])):
                return False
        
        return True