LeetCode题解(python)-36. 有效的数独

LeetCode题解（python）

36. 有效的数独

题目描述

判断一个 9x9 的数独是否有效。只需要根据以下规则，验证已经填入的数字是否有效即可。

1. 数字 1-9 在每一行只能出现一次。
2. 数字 1-9 在每一列只能出现一次。
3. 数字 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 形式的。

解题心得

本题免不了要遍历，即使这样，时间复杂度也只是$O(1)$，因为只有有限的81个格子

但是如果嵌套多层遍历+一个一个丢进数组再一个一个查找的方式就太low了

一般有人用字典，查到一次就计数一次，使用value值计数

我可能脑子搭错筋了，突然不想用字典，想用集合set的性质，集合中没有重复元素……so，只需要对比集合的长度和list的长度即可。长度相同，则没问题，长度不同，说明不满足题意

另外有人处理九宫格的方式值得学习，不过整体效率上几乎没区别。

以下代码执行用时 : 84 ms, 在Valid Sudoku的Python3提交中击败了53.55% 的用户

解题代码

class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        for i in range(9):
            lst = []
            for j in range(9):
                if board[i][j] != '.':
                    lst.append(board[i][j])   
            lst_check = list(set(lst))
            if len(lst) != len(lst_check):
                return False
        for i in range(9):
            lst = []
            for j in range(9):
                if board[j][i] != '.':
                    lst.append(board[j][i])   
            lst_check = list(set(lst))
            if len(lst) != len(lst_check):
                return False
        for i in range(0,9,3):
            for j in range(0,9,3):
                lst = []
                for ki in range(i,i+3):
                    for kj in range(j,j+3):
                        if board[ki][kj] != '.':
                            lst.append(board[ki][kj])
                lst_check = list(set(lst))
                if len(lst) != len(lst_check):
                    return False
        return True