leeetcode36-有效的数独

最新推荐文章于 2024-11-01 15:19:21 发布

cicoa

最新推荐文章于 2024-11-01 15:19:21 发布

阅读量190

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/thenorther/article/details/104123517

版权

leetcode 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

leeetcode36-有效的数独

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

题解

先判断行列是否满足要求，
在判断9个小格子是否满足要求
复杂度 $O(n^2)$

class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        n=9
        check_row=[]
        check_col=[]
        check_grad=[]
        for i in range(9):
            for j in range(9):
                if board[i][j] != '.': 
                    if board[i][j] in check_row: return False
                    check_row.append(board[i][j])
                if board[j][i] != '.':
                    if board[j][i] in check_col: return False
                    check_col.append(board[j][i])
            check_row=[]
            check_col=[]
        for i in range(3):
            for j in range(3):
                for r in range(3):
                    if board[i*3+r][j*3] != '.':
                        if board[i*3+r][j*3] in check_grad:return False
                        check_grad.append(board[i*3+r][j*3])
                    if board[i*3+r][j*3+1] != '.':
                        if board[i*3+r][j*3+1] in check_grad:return False
                        check_grad.append(board[i*3+r][j*3+1])
                    if board[i*3+r][j*3+2] != '.':
                        if board[i*3+r][j*3+2] in check_grad:return False
                        check_grad.append(board[i*3+r][j*3+2])
                    
                check_grad=[]

        return True