36. 有效的数独 Python

---

一、题目描述

请你判断一个 9 x 9 的数独是否有效。只需要 根据以下规则 ，验证已经填入的数字是否有效即可。
数字 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 存在, 因此这个数独是无效的。

提示：
board.length == 9
board[i].length == 9
board[i][j] 是一位数字（1-9）或者 '.'

二、代码

代码如下：

class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        Matrix = [[],[],[],[],[],[],[],[],[]]
        Row = [[],[],[],[],[],[],[],[],[]]
        Column = [[],[],[],[],[],[],[],[],[]]
        ###每一行元素
        for i in range(9):
            for e in board[i]:
                if e != ".":
                    Row[i].append(e)
        print("Row:",Row)
        ###每一列元素
        for i in range(9):
            for j in range(9):
                if board[j][i] != ".":
                    Column[i].append(board[j][i])
        print("Column:",Column)
        ###9个小矩阵
        for i in range(9):
            for j in range(9):
                if 0<=i<=2 and 0<=j<=2 and board[i][j]!=".":
                    Matrix[0].append(board[i][j])
                if 0<=i<=2 and 3<=j<=5 and board[i][j]!=".":
                    Matrix[1].append(board[i][j])
                if 0<=i<=2 and 6<=j<=8 and board[i][j]!=".":
                    Matrix[2].append(board[i][j])
                if 3<=i<=5 and 0<=j<=2 and board[i][j]!=".":
                    Matrix[3].append(board[i][j])
                if 3<=i<=5 and 3<=j<=5 and board[i][j]!=".":
                    Matrix[4].append(board[i][j])
                if 3<=i<=5 and 6<=j<=8 and board[i][j]!=".":
                    Matrix[5].append(board[i][j])
                if 6<=i<=8 and 0<=j<=2 and board[i][j]!=".":
                    Matrix[6].append(board[i][j])
                if 6<=i<=8 and 3<=j<=5 and board[i][j]!=".":
                    Matrix[7].append(board[i][j])
                if 6<=i<=8 and 6<=j<=8 and board[i][j]!=".":
                    Matrix[8].append(board[i][j])
        print("Matrix:", Matrix)
        ###9个小矩阵的判重
        for i in range(9):
            if len(Matrix[i]) != len(set(Matrix[i])):
                print("false")
                return False
        ###9行的判重
        for i in range(9):
            if len(Row[i]) != len(set(Row[i])):
                print("false")
                return False
        ###9列的判重
        for i in range(9):
            if len(Column[i]) != len(set(Column[i])):
                print("false")
                return False
        return True

---

三、解题思路

本题采用暴力法解题，满足题意给出的三个条件判断即可，判断每一行是否存在重复元素，判断某一列是否存在重复元素，再判断每一个小矩阵中是否存在重复元素。需要注意的是，先需要把空格（"."）排除掉，才能用set方法快速判断list列表中是否存在重复元素。如果上面三个判断结果均符合，则返回True，反之，则返回False。