[Leetcode]有效的数独-Python3

[Leetcode]有效的数独

Leetcode-有效的数独

题目描述

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

解题思路
  • 如何判断 3 × 3 3\times3 3×3 的子数独

    • 使用 $ box_index=(row/3)*3+col/3 , 其 中 ,其中 /$是整数除法
      在这里插入图片描述
  • 如何确保行、列、子数独中没有重复项

    • 利用 value-count 哈希映射来跟踪所有已经遇到的值,在Python中使用字典
  • 如何在一次迭代中实现

    • 遍历数独,遇到不是“.”的字符,则对应每行、列、子数独数量加一,然后检查是否存在count大于1

在这里插入图片描述

实现代码
//Python3
class Solution:
    def isValidSudoku(self, board: List[List[str]]) -> bool:
        rows=[{}for i in range(9)]
        cols=[{}for i in range(9)]
        boxes=[{}for i in range(9)]

        for i in range(9):
            for j in range(9):                
                if board[i][j]!='.':

                    box_index=(i//3)*3+j//3

                    rows[i][board[i][j]]=rows[i].get(board[i][j],0)+1
                    cols[j][board[i][j]]=cols[j].get(board[i][j],0)+1
                    boxes[box_index][board[i][j]]=boxes[box_index].get(board[i][j],0)+1

                    if rows[i][board[i][j]]>1 or cols[j][board[i][j]]>1 or boxes[box_index][board[i][j]]>1:
                        return False

        return True

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值