36. 有效的数独

请你判断一个 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）或者 '.'

来源：力扣（LeetCode）
链接：https://leetcode.cn/problems/valid-sudoku
著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

我的思路：

把这个二维数组的每行和每列都各自拿出来用两次循环进行遍历，如果存在相同的数字直接输出False，遇到“.”则跳过，最后把每行的个列表的前三个值拿出来再与3-6列再与6-8列的值分别拿出来拼接在一起，拼做一个一维数组， 在这个一维数组上可以继续用循环遍历按上面的操作判断，但是我这里先转为一个二维数组让他更加清晰直观，然后判断，最后也是压线过，不过第一思路就是按这种方法暴力求解。

代码如下：

from typing import List
class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        # i = 0
        # s = board[i]
        # 判断列是否合格
        for l in range(9):
            b = [i[l] for i in board]
            for i in range(9):
                if b[i] == ".":
                    continue
                for j in range(i+1,9):
                    if b[j] == ".":
                        continue
                    if b[i] == b[j]:
                        return False
        # 判断行是否合格
        for l in range(9):
            b = board[l]
            for i in range(9):
                if b[i] == ".":
                    continue
                for j in range(i + 1, 9):
                    if b[j] == ".":
                        continue
                    if b[i] == b[j]:
                        return False
        # 判断九个格子是否合格
        a = list()
        for i in range(9):
            for j in range(3):
                a.append(board[i][j])
        for i in range(9):
            for j in range(3, 6):
                a.append(board[i][j])
        for i in range(9):
            for j in range(6, 9):
                a.append(board[i][j])
        import numpy as np
        arr = np.array(a)
        arr_2d = arr.reshape((9, 9))
        for l in range(9):
            b = arr_2d[l]
            for i in range(9):
                if b[i] == ".":
                    continue
                for j in range(i + 1, 9):
                    if b[j] == ".":
                        continue
                    if b[i] == b[j]:
                        return False
        return True

看了一下官方的题解，最后对九宫格的处理比较省时。

        for i in range(0, 9, 3):                   #对九宫格是否重复进行判断
            for j in range(0, 9, 3):
                storage = []
                for x in range(0, 3):
                    for y in range(0, 3):
                        if board[i + x][j + y] == '.':
                            continue
                        if board[i + x][j + y] in storage:
                            return False
                        else:
                            storage.append(board[i + x][j + y])