LEETCODE 10【数组】有效的数独

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

class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        import pandas as pd
        import numpy as np
        board2=pd.DataFrame(board)
        board2
        k1,k2=0,0
        for j in range(2):
            for i in range(9):

                if (board2[i].replace('.',np.nan).count())==len(set(board2[i]))-1:
                    k1+=1

                if i==8:

                    board2=board2.T

        l=[[],[],[],[],[],[],[],[],[]]
        for i in range(0,9,3):
            c=0
            for j in range(0,9,3):
                for m in range(3):
                    for n in range(3):
                        l[i+c].append(board2[i+n][j+m])
                c+=1
        for i in range(9):
            if (len(l[0])-l[0].count('.'))==(len(set(l[0]))-1):
                k2+=1
        if (k1==18)&(k2==9):
            return True
        else:
            return False

可是
不支持导包

是的，这题我没搞定，有点晕了，感觉自己想复杂了 ，用了以下代码通过的

class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        rows = [list(lst[::]) for lst in board]
        columns = [[lst[idx] for lst in board] for idx in range(9)]
        blocks_origin = [board[row][column] for x in [[0, 1, 2], [3, 4, 5], [6, 7, 8]] for y in[[0, 1, 2], [3, 4, 5], [6, 7, 8]] for row in x for column in y]  # 利用一些技巧直接按块储存数据
        blocks = [[blocks_origin[row * 9 + column] for column in range(9)] for row in range(9)]
        check = lambda lst: all([lst.count(x) == 1 for x in lst if x != '.'])  # 判断一条记录（按某种方式排列的九个数字）是否合法
        return all([check(x) for style in (rows, columns, blocks) for x in style])

执行用时：104 ms
内存消耗：13.7 MB

来看看20ms的例子

class Solution:
    def isValidSudoku(self, board) :

        def func(result):
            re = []
            for s in result:
                if s != '.':
                    if s not in re:
                        re.append(s)
                    else:
                        return False
                    
        for x in [1,4,7]:
            for y in [1,4,7]:
                result = [board[x-1][y-1],board[x-1][y],board[x-1][y+1],
                          board[x][y-1]  ,board[x][y]  ,board[x][y+1]  ,
                          board[x+1][y-1],board[x+1][y],board[x+1][y+1]]
                if func(result) == False:
                    return False

        for i in board:
            if func(i) == False:
                return False
        for k in range(len(board)):
            if func([v[k] for v in board]) == False:
                return False
        
        return True